On graphs with cyclic defect or excess
From MaRDI portal
Publication:612923
zbMath1204.05043arXiv1010.5841MaRDI QIDQ612923
Charles Delorme, Guillermo Pineda-Villavicencio
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5841
Pell equationChebyshev polynomial of the second kinddefectexcessMoore boundMoore graphcyclic excesscyclic defect
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items
A lower bound for the discriminant of polynomials related to Chebyshev polynomials ⋮ On graphs with excess or defect 2 ⋮ On bipartite cages of excess 4 ⋮ On graphs of defect at most 2
This page was built for publication: On graphs with cyclic defect or excess