On the algebraic theory of pseudo-distance-regularity around a set
From MaRDI portal
Publication:5953716
DOI10.1016/S0024-3795(99)00154-8zbMath0984.05060WikidataQ126819179 ScholiaQ126819179MaRDI QIDQ5953716
Publication date: 28 January 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
eigenvaluecharacterizationscompletely regular codeseigenvectoradjacency matrixdistance-regularityorthogonal sequence of polynomials
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (26)
Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ Characterizing and computing weight-equitable partitions of graphs ⋮ On outindependent subgraphs of strongly regular graphs ⋮ On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Pseudo-Strong Regularity Around a Set ⋮ On the trivial \(T\)-module of a graph ⋮ The subconstituent algebra of a strongly regular graph ⋮ On the Terwilliger algebra of distance-biregular graphs ⋮ On some approaches to the spectral excess theorem for nonregular graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ A characterization and an application of weight-regular partitions of graphs ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ On almost distance-regular graphs ⋮ A spectral excess theorem for nonregular graphs ⋮ A characterization of bipartite distance-regular graphs ⋮ Pseudo-distance-regularized graphs are distance-regular or distance-biregular ⋮ On pseudo-distance-regularity ⋮ Algebraic characterizations of graph regularity conditions ⋮ Edge-distance-regular graphs ⋮ Unnamed Item ⋮ A characterization of weight-regular partitions of graphs ⋮ On bipartite graphs with exactly one irreducible \(T\)-module with endpoint 1, which is thin ⋮ Certain graphs with exactly one irreducible \(T\)-module with endpoint 1, which is thin ⋮ Graphs, friends and acquaintances ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions
This page was built for publication: On the algebraic theory of pseudo-distance-regularity around a set
