AbstractThe concept of (local) pseudo-distance-regularity, recently introduced, is a natural generalization of distance-regularity, intended for not necessarily regular graphs. We study here some properties of locally pseudo-distance-regular graphs and give some new characterization of such structures. As a consequence, some new characterizations of distance-regular graphs are also derived
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that o...
AbstractGenerally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of...
* distance-regularity; * local spectra; * predistance polynomials; * the spectral excess...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractLet Γ be a connected graph with vertex set V, adjacency matrix A, positive eigenvector ν and...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractThe concept of (local) pseudo-distance-regularity, recently introduced, is a natural general...
AbstractThe concept of pseudo-distance-regularity around a vertex of a graph is a natural generaliza...
AbstractThe local adjacency polynomials can be thought of as a generalization, for all graphs, of (t...
AbstractThe local adjacency polynomials can be thought of as a generalization, for all graphs, of (t...
Let C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corresp...
Let C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corres...
AbstractThe concept of pseudo-distance-regularity around a vertex of a graph is a natural generaliza...
Given a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regula...
AbstractThis is a survey of recent results showing that the usual concepts of (local or global) dist...
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that o...
AbstractGenerally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of...
* distance-regularity; * local spectra; * predistance polynomials; * the spectral excess...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractLet Γ be a connected graph with vertex set V, adjacency matrix A, positive eigenvector ν and...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractThe concept of (local) pseudo-distance-regularity, recently introduced, is a natural general...
AbstractThe concept of pseudo-distance-regularity around a vertex of a graph is a natural generaliza...
AbstractThe local adjacency polynomials can be thought of as a generalization, for all graphs, of (t...
AbstractThe local adjacency polynomials can be thought of as a generalization, for all graphs, of (t...
Let C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corresp...
Let C be a connected graph with vertex set V, adjacency matrix A, positive eigenvector and corres...
AbstractThe concept of pseudo-distance-regularity around a vertex of a graph is a natural generaliza...
Given a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regula...
AbstractThis is a survey of recent results showing that the usual concepts of (local or global) dist...
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that o...
AbstractGenerally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of...
* distance-regularity; * local spectra; * predistance polynomials; * the spectral excess...
DOI
Add to ORKG