Spectral results on regular graphs with \((k,\tau)\)-regular sets

DOI10.1016/j.disc.2005.11.068zbMath1118.05059OpenAlexW2089428924MaRDI QIDQ878619

Domingos Moreira Cardoso, Paula Rama

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.068

zbMATH Keywords

grapheigenvaluesAdjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Efficient domination through eigenvalues ⋮ Laplacian eigenvectors and eigenvalues and almost equitable partitions ⋮ A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\) ⋮ Maximum \(k\)-regular induced subgraphs ⋮ Eigenvalues of a \(H\)-generalized join graph operation constrained by vertex subsets ⋮ Main eigenvalues and \((\kappa ,\tau )\)-regular sets ⋮ A generalization of Fiedler's lemma and the spectra of \(H\)-join of graphs ⋮ Relations between (κ, τ)-regular sets and star complements ⋮ Weighted perfect codes in Lee metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The walk partition and colorations of a graph
• A surprising property of the least eigenvalue of a graph
• Problems in algebraic combinatorics
• On graphs with three eigenvalues
• Equitable bipartitions of graphs and related results
• Independent sets with domination constraints