Eigenvalue interlacing and weight parameters of graphs

DOI10.1016/S0024-3795(98)10238-0zbMath0933.05099arXiv1206.0367WikidataQ126789350 ScholiaQ126789350MaRDI QIDQ1300913

V. Pereyra

Publication date: 2 September 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.0367

zbMATH Keywords

eigenvectorregular graphschromatic numberLaplacian matrixShannon capacityinterlacingvertex weights

Mathematics Subject Classification ID

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

Related Items (21)

Distance mean-regular graphs ⋮ Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses ⋮ Characterizing and computing weight-equitable partitions of graphs ⋮ On outindependent subgraphs of strongly regular 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 ⋮ 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 ⋮ A spectral excess theorem for nonregular graphs ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ A characterization of bipartite distance-regular graphs ⋮ An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ On pseudo-distance-regularity ⋮ Graphs and Hermitian matrices: eigenvalue interlacing ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ Spectra of large random trees ⋮ A characterization of weight-regular partitions of graphs ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ On the hierarchical product of graphs and the generalized binomial tree ⋮ On the \(k\)-independence number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with given diameter maximizing the spectral radius
• Feasibility conditions for the existence of walk-regular graphs
• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• The sandwich theorem
• Problems in algebraic combinatorics
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Eigenvalues, eigenspaces and distances to subsets
• An eigenvalue characterization of antipodal distance-regular graphs
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Boundary graphs: The limit case of a spectral property
• Interlacing eigenvalues and graphs
• Upper bounds for eigenvalues of the discrete and continuous Laplace operators
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Isoperimetric Inequalities and Eigenvalues
• On the Shannon capacity of a graph
• Pseudo-Strong Regularity Around a Set
• Eigenvalues and the diameter of graphs

This page was built for publication: Eigenvalue interlacing and weight parameters of graphs