Quasi-(��; n)-distance-balanced graphs
| Autor: | Pourhadi, Ehsan, Faghani, Morteza |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| DOI: | 10.48550/arxiv.1909.02634 |
| Popis: | For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-(��; n)-distance-balanced graphs and then study some properties of these graphs and present a formula to construct such graphs for arbitrarily diameter d. For n = 1, this class of graphs contains the quasi-��-DB graphs recently introduced by Abedi et al. [Quasi-��-distance-balanced graphs, Discrete Appl. Math. 227 (2017) 21{28]. Moreover, we will take a look at the problems arisen by Abedi et al. Some problems and conjecture are involved. 15 pages, 13 figures, this paper is prepared to submit to a journal in the future |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|