On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship
DOI10.1016/j.dam.2023.03.015OpenAlexW4360603431MaRDI QIDQ2700618
S. Zeijlemaker, C. Dalfó, Aida Abiad, Miquel Àngel Fiol
Publication date: 27 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04901
polynomialsindependence numbermixed integer linear programmingadjacency spectrum\(k\)-power graph\(k\)-partially walk-regular
Linear programming (90C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow connection number of graph power and graph products
- Spectral bounds for the \(k\)-independence number of a graph
- Proof of a conjectured lower bound on the chromatic number of a graph
- Unified spectral bounds on the chromatic number
- Feasibility conditions for the existence of walk-regular graphs
- Ovoids and spreads of finite classical polar spaces
- Polarities of generalized hexagons and perfect codes
- Independence and average distance in graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- An eigenvalue characterization of antipodal distance-regular graphs
- Interlacing eigenvalues and graphs
- Laplacian eigenvalues of the second power of a graph
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- The \(k\)-independence number of \(t\)-connected graphs
- On the \(k\)-independence number of graphs
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Strongly regular graphs with strongly regular decomposition
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Some Spectral Characterizations of Strongly Distance-Regular Graphs
- The geometry oft-spreads ink-walk-regular graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the Polynomial of a Graph
- On the Shannon capacity of a graph
- Combinatorial Designs
- On the $b$ -Independence Number of Sparse Random Graphs
- Average Degree in Graph Powers
- Spectral upper bound on the quantum k-independence number of a graph
- CORES OF SYMMETRIC GRAPHS
- An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
This page was built for publication: On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship
