On almost distance-regular graphs
From MaRDI portal
Publication:2431269
DOI10.1016/j.jcta.2010.10.005zbMath1225.05249arXiv1202.3265OpenAlexW2167900279MaRDI QIDQ2431269
C. Dalfó, E. Garriga, Bram L. Gorissen, van Dam, Edwin R., Miquel Àngel Fiol
Publication date: 11 April 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3265
Related Items
2-walk-regular dihedrants from group-divisible designs, On bipartite distance-regular Cayley graphs with small diameter, Resistance characterizations of equiarboreal graphs, Edge-distance-regular graphs are distance-regular, On some approaches to the spectral excess theorem for nonregular graphs, The spectral excess theorem for distance-biregular graphs., A spectral equivalent condition of the \(P\)-polynomial property for association schemes, Quotient-polynomial graphs, Some results on the eigenvalues of distance-regular graphs, 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs, A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number, Geometric aspects of 2-walk-regular graphs, A spectral excess theorem for nonregular graphs, Dual concepts of almost distance-regularity and the spectral excess theorem, On symmetric association schemes and associated quotient-polynomial graphs, A characterization of bipartite distance-regular graphs, The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues, A spectral excess theorem for normal digraphs, 2-walk-regular graphs with a small number of vertices compared to the valency, On the non-existence of antipodal cages of even girth, Partially metric association schemes with a multiplicity three, On bipartite cages of excess 4, Some spectral and quasi-spectral characterizations of distance-regular graphs, Edge-distance-regular graphs, On perturbations of almost distance-regular graphs, Edge-disjoint spanning trees and forests of graphs, A spectral excess theorem for digraphs with normal Laplacian matrices, Algebraic characterizations of regularity properties in bipartite graphs, Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity, The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\), On 2-walk-regular graphs with a large intersection number \(c_2\), Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one, The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular, Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\), Spectrally extremal vertices, strong cospectrality, and state transfer
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing \((\ell ,m)\)-walk-regular graphs
- Characterizing distance-regularity of graphs by the spectrum
- A simple proof of the spectral excess theorem for distance-regular graphs
- The spectral excess theorem for distance-regular graphs: a global (over)view
- Higmanian rank-5 association schemes on 40 points
- On \(k\)-walk-regular graphs
- Commutative association schemes
- Distance degree regular graphs
- Locally pseudo-distance-regular graphs
- Feasibility conditions for the existence of walk-regular graphs
- On distance-regularity in graphs
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Problems in algebraic combinatorics
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Vertex-symmetric generalized Moore graphs.
- Boundary graphs: The limit case of a spectral property
- On the Polynomial of a Graph
- Algebraic Graph Theory
- On the algebraic theory of pseudo-distance-regularity around a set
