On almost distance-regular graphs

From MaRDI portal
Revision as of 21:51, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (36)

2-walk-regular dihedrants from group-divisible designsOn bipartite distance-regular Cayley graphs with small diameterResistance characterizations of equiarboreal graphsEdge-distance-regular graphs are distance-regularOn some approaches to the spectral excess theorem for nonregular graphsThe spectral excess theorem for distance-biregular graphs.A spectral equivalent condition of the \(P\)-polynomial property for association schemesQuotient-polynomial graphsSome results on the eigenvalues of distance-regular graphs2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphsA new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence numberGeometric aspects of 2-walk-regular graphsA spectral excess theorem for nonregular graphsDual concepts of almost distance-regularity and the spectral excess theoremOn symmetric association schemes and associated quotient-polynomial graphsA characterization of bipartite distance-regular graphsThe spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvaluesA spectral excess theorem for normal digraphs2-walk-regular graphs with a small number of vertices compared to the valencyOn the non-existence of antipodal cages of even girthPartially metric association schemes with a multiplicity threeOn bipartite cages of excess 4Some spectral and quasi-spectral characterizations of distance-regular graphsEdge-distance-regular graphsOn perturbations of almost distance-regular graphsEdge-disjoint spanning trees and forests of graphsA spectral excess theorem for digraphs with normal Laplacian matricesAlgebraic characterizations of regularity properties in bipartite graphsEquivalent characterizations of the spectra of graphs and applications to measures of distance-regularityThe 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 powersThe 2-partially distance-regular graphs such that their second largest local eigenvalues are at most oneThe spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regularThin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)Spectrally extremal vertices, strong cospectrality, and state transfer



Cites Work




This page was built for publication: On almost distance-regular graphs