1996
DOI: 10.1006/jctb.1996.0063
|View full text |Cite
|
Sign up to set email alerts
|

Locally Pseudo-Distance-Regular Graphs

Abstract: The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs.Intuitively speaking, such a concept is related to the regularity of graph 1 when it is seen from a given vertex. The price to be paid for speaking about a kind of distance-regularity in the non-regular case seems to be locality. Thus, we find out that there are no genuine``global'' pseudo-distance-regular graphs: when pseudodistance-regularity i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
105
0

Year Published

1997
1997
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 72 publications
(113 citation statements)
references
References 13 publications
5
105
0
Order By: Relevance
“…Locally pseudo-distance-regular graphs, see [17] or Section 3, generalize, for the nonregular case, the concept of distance-regular graphs, extensively studied in the literature. See, for instance, the basic books of Biggs [3], Brouwer et al [6], Cvetkovic et al [8], and Godsil [18].…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…Locally pseudo-distance-regular graphs, see [17] or Section 3, generalize, for the nonregular case, the concept of distance-regular graphs, extensively studied in the literature. See, for instance, the basic books of Biggs [3], Brouwer et al [6], Cvetkovic et al [8], and Godsil [18].…”
Section: Introductionmentioning
confidence: 98%
“…The values cos ; ij , 1 i n, 0 j d, were formally introduced by Cvetkovic as the``angles'' of 1 (see, for instance, [7].) As was shown in [17], when the graph is seen from a vertex, its local multiplicities play a role similar to the standard multiplicities. Thus, for any vertex e i , m i (* l ) 0 and d l=0 m i (* l )=1.…”
Section: Introductionmentioning
confidence: 99%
“…, d, in which case they turn out to be the distance polynomials. In fact, we have the following strongest proposition, which is a combination of results in [14,7]. …”
Section: Preliminariesmentioning
confidence: 76%
“…We know that if the graph G is 2-antipodal distance-regular 4 , then it can be characterized by the eigenvalues of its adjacency matrix, and their multiplicities, Fiol et al (1996) . It means that the properties of an investment strategy represented by such a graph can also be resumed by its eigevalues.…”
Section: General Expression For the Spectral Distributionmentioning
confidence: 99%