Interlacing eigenvalues and graphs

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

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

bandwidth diameter adjacency matrix chromatic number regular graph Laplacian matrix clique block designs coclique eigenvalue interlacing

Mathematics Subject Classification ID

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

Related Items (only showing first 100 items - show all)

Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ On outindependent subgraphs of strongly regular graphs ⋮ On the Aα-spectral radius of connected graphs ⋮ On the spectral radius, energy and Estrada index of the arithmetic–geometric matrix of a graph ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ On the spectral radius, energy and Estrada index of the Sombor matrix of graphs ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ Bounding the sum of the largest signless Laplacian eigenvalues of a graph ⋮ The proportion of non-degenerate complementary subspaces in classical spaces ⋮ Fractional matching, factors and spectral radius in graphs involving minimum degree ⋮ Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube ⋮ Positive and negative square energies of graphs ⋮ Nullities of cycle-spliced bipartite graphs ⋮ Spectral properties of token graphs ⋮ Incidence‐free sets and edge domination in incidence graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Spectral characterization of the complete graph removing a cycle ⋮ On the spectra and spectral radii of token graphs ⋮ Induced forests in some distance-regular graphs ⋮ On the multiplicities of digraph eigenvalues ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Community detection in attributed networks for global transfer market ⋮ DISTRIBUTION OF ACCUMULATION POINTS OF ROOTS FOR TYPE (n - 1, 1) COXETER GROUPS ⋮ On finite generalized quadrangles of even order ⋮ On spectral invariants of the \(\alpha\)-mixed adjacency matrix ⋮ The asymptotics of \(r(4,t)\) ⋮ Improved incidence bounds over arbitrary finite fields via the VC-dimension theory ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edge connectivity, packing spanning trees, and eigenvalues of graphs ⋮ Simple eigenvalues of cubic vertex-transitive graphs ⋮ The level matrix of a tree and its spectrum ⋮ A unified combinatorial view beyond some spectral properties ⋮ Toughness and distance spectral radius in graphs involving minimum degree ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ Further results on monotonic graph invariants and bipartiteness number ⋮ The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\) ⋮ Unnamed Item ⋮ Note on the product of the largest and the smallest eigenvalue of a graph ⋮ On the distance and distance Laplacian eigenvalues of graphs ⋮ Upper bounds for the number of substructures in finite geometries from the container method ⋮ Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\) ⋮ Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights ⋮ Vertex cut, eigenvalues, \([a,b\)-factors and toughness of connected bipartite graphs] ⋮ Proactive secret sharing with constant communication ⋮ Small weight codewords of projective geometric codes. II ⋮ A unified framework for the expander mixing lemma for irregular graphs and its applications ⋮ The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs ⋮ A spectral condition for a graph to have strong parity factors ⋮ Spectral radius, odd \([1, b\)-factor and spanning \(k\)-tree of 1-binding graphs] ⋮ Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs ⋮ A note on the distinct eigenvalues of quotient matrices ⋮ The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds ⋮ Unnamed Item ⋮ Fractional matching number and eigenvalues of a graph ⋮ Trace of Products in Finite Fields from a Combinatorial Point of View ⋮ Distance mean-regular graphs ⋮ Improved sufficient conditions for \(k\)-leaf-connected graphs ⋮ Regular Graphs, Eigenvalues and Regular Factors ⋮ Multi-attribute community detection in international trade network ⋮ Colouring the normalized Laplacian ⋮ Characterizing and computing weight-equitable partitions of graphs ⋮ Unnamed Item ⋮ A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Pseudo-Strong Regularity Around a Set ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ Unnamed Item ⋮ Laplacian spectral bounds for clique and independence numbers of graphs ⋮ Spectral Bounds for the k-Regular Induced Subgraph Problem ⋮ Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs ⋮ Spectral Radius of Graphs ⋮ Handling Biological Complexity Using Kron Reduction ⋮ A spectral condition for the existence of the square of a path ⋮ Finite Field Kakeya and Nikodym Sets in Three Dimensions ⋮ Hoffman's ratio bound ⋮ New values for the bipartite Ramsey number of the four-cycle versus stars ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ On sensitivity in bipartite Cayley graphs ⋮ Lower bounds for the bandwidth problem ⋮ Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph ⋮ A survey on the missing Moore graph ⋮ A characterization and an application of weight-regular partitions of graphs ⋮ Wiener-type invariants and \(k\)-leaf-connected graphs ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ An inequality involving the second largest and smallest eigenvalue of a distance-regular graph ⋮ An improvement of sufficient condition for \(k\)-leaf-connected graphs ⋮ Edge-connectivity and (signless) Laplacian eigenvalue of graphs ⋮ Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping ⋮ Reflexive bipartite regular graphs ⋮ On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication ⋮ Graph toughness from Laplacian eigenvalues ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights

Cites Work

This page was built for publication: Interlacing eigenvalues and graphs