Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
From MaRDI portal
Publication:2380238
zbMath1230.05120MaRDI QIDQ2380238
E. Garriga, J. Fàbrega, M. Cámara, Miquel Àngel Fiol
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231962
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
Distance mean-regular graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ A generalization of the odd-girth theorem ⋮ On the spectra and spectral radii of token graphs ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ Dual concepts of almost distance-regularity and the spectral excess theorem ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ 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 ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ A simple proof of the spectral excess theorem for distance-regular graphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Edge-distance-regular graphs ⋮ Unnamed Item ⋮ Algebraic characterizations of regularity properties in bipartite graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ On a version of the spectral excess theorem ⋮ On the \(k\)-independence number of graphs ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions
