Interlacing eigenvalues and graphs

DOI10.1016/0024-3795(95)00199-2zbMATH Open0831.05044OpenAlexW2060493211WikidataQ29041976 ScholiaQ29041976MaRDI QIDQ1899437

Willem H. Haemers

Publication date: 12 February 1996

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

Full work available at URL: https://pure.uvt.nl/ws/files/519743/675.pdf

zbMATH Keywords

bandwidthLaplacian matrixadjacency matrixchromatic numberdiametercliqueregular graphblock designscocliqueeigenvalue interlacing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A domain monotonicity theorem for graphs and Hamiltonicity
• Hamilton cycles and eigenvalues of graphs
• On the Shannon capacity of a graph
• Cospectral graphs and the generalized adjacency matrix
• Problems in algebraic combinatorics
• The Gewirtz graph: An exercise in the theory of graph spectra
• Spherical codes and designs
• Uniqueness of strongly regular graphs having minimal \(p\)-rank
• The connectivity of strongly regular graphs
• Toughness and spectrum of a graph
• Generalized quadrangles with a regular point and association schemes
• Regular 2-graphs and extensions of partial geometries
• Diameter, covering index, covering radius and eigenvalues
• Some remarks on multivariate Chebyshev polynomials
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• 2-designs having an intersection number \(k-n\)
• An Inequality for Generalized Quadrangles
• Some remarks on subdesigns of symmetric designs
• On subdesigns of symmetric designs

Cited In (only showing first 100 items - show all)

• A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
• The cyclic edge-connectivity of strongly regular graphs
• Pseudo-Strong Regularity Around a Set
• Sharp bounds on the eigenvalues of trees
• Spectra of large random trees
• Distance mean-regular graphs
• Vertex-connectivity and eigenvalues of graphs
• On graphs with three distinct signless Laplacian eigenvalues
• Combinatorial and spectral properties of König-Egerváry graphs
• Title not available (Why is that?)
• Eigenvalues and diameter
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• On the inverse of the adjacency matrix of a graph
• Eigenvalues and \([1,n]\)-odd factors
• On \(\lambda\)-harmonic graphs
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• Improving an upper bound on the stability number of a graph
• Bounds on special subsets in graphs, eigenvalues and association schemes
• On the integrability of strongly regular graphs
• Trace of Products in Finite Fields from a Combinatorial Point of View
• Distance and distance signless Laplacian spread of connected graphs
• The Hermitian two-graph and its code
• New lower bounds for the Randić spread
• Graphs and Hermitian matrices: Exact interlacing
• A spectral characterization of the \(s\)-clique extension of the square grid graphs
• Explicit non-malleable codes from bipartite graphs
• Distance signless Laplacian eigenvalues of graphs
• On the \(k\)-independence number of graphs
• Nodal decompositions of graphs
• Nonexistence of some antipodal distance-regular graphs of diameter four
• The extremal spectral radii of the arithmetical structures on paths
• Graphs and Hermitian matrices: eigenvalue interlacing
• Spectral classes of regular, random, and empirical graphs
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Extremal graphs with bounded vertex bipartiteness number
• Fractional matching number and eigenvalues of a graph
• Stability of conjugated carbon nanocones
• Matching extendability and connectivity of regular graphs from eigenvalues
• Spectral characterization of the complete graph removing a path
• Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type
• Finite Field Kakeya and Nikodym Sets in Three Dimensions
• Spectral lower bounds for the quantum chromatic number of a graph. II
• Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
• Some interlacing results for the eigenvalues of distance-regular graphs
• Signless Laplacian spectral radius and fractional matchings in graphs
• Cut ratios and Laplacian eigenvalues
• Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph
• On the multiplicities of digraph eigenvalues
• On graphs with the largest Laplacian index
• An application of Hoffman graphs for spectral characterizations of graphs
• Bicliques and eigenvalues
• Minimal multiple blocking sets
• Bounding the sum of the largest signless Laplacian eigenvalues of a graph
• Large regular bipartite graphs with median eigenvalue 1
• Theorems on partitioned matrices revisited and their applications to graph spectra
• A new family of tight sets in \(\mathcal Q^+(5,q)\)
• Laplacian spectral bounds for clique and independence numbers of graphs
• A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\)
• A note on eigenvalue bounds for independence numbers of non-regular graphs
• Upper bounds on the (signless) Laplacian eigenvalues of graphs
• Spectral radius and Hamiltonian graphs
• The spectrum and toughness of regular graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• On the spectrum of an extremal graph with four eigenvalues
• Bounds of Laplacian spectrum of graphs based on the domination number
• Intriguing sets of vertices of regular graphs
• On the spread of the spectrum of a graph
• Minimum vertex covers and the spectrum of the normalized Laplacian on trees
• Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• The vertex-connectivity of a distance-regular graph
• Three-class association schemes
• On regular induced subgraphs of generalized polygons
• Spectral bisection of graphs and connectedness
• Some results on the bounds of signless Laplacian eigenvalues
• On the distance and distance Laplacian eigenvalues of graphs
• 5-chromatic strongly regular graphs
• Large matchings from eigenvalues
• A characterization of distance-regular graphs with diameter three
• Eigenvalue interlacing and weight parameters of graphs
• On the Laplacian spectral ratio of connected graphs
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs
• The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
• On monoid graphs
• The spectra of some families of digraphs
• Matchings in regular graphs from eigenvalues
• Eigenvalues and perfect matchings
• A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
• The graph with spectrum \(14^{1} 2^{40}( - 4)^{10}( - 6)^{9}\)
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Distance spectral spread of a graph
• The largest normalized Laplacian spectral radius of non-bipartite graphs
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Laplacian spread of graphs: lower bounds and relations with invariant parameters
• Distance-regular graphs with or at least half the valency
• Toughness and spectrum of a graph
• On the spectra of simplicial rook graphs
• Eigenvalues and edge-connectivity of regular graphs
• Spreads in strongly regular graphs

This page was built for publication: Interlacing eigenvalues and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899437)