On the \(k\)-independence number of graphs

DOI10.1016/j.disc.2019.01.016zbMath1417.05148arXiv1803.07042OpenAlexW2963682341MaRDI QIDQ2317661

Gabriel Coutinho, Aida Abiad, Miquel Àngel Fiol

Publication date: 12 August 2019

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

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

zbMATH Keywords

spectruminterlacingregular partition\(k\)-independence numberantipodal distance-regular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ The \(k\)-independence number of \(t\)-connected graphs ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

Cites Work

• Spectral bounds for the \(k\)-independence number of a graph
• The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
• Locally pseudo-distance-regular graphs
• Eigenvalue interlacing and weight parameters of graphs
• Problems in algebraic combinatorics
• Independence and average distance in graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• An eigenvalue characterization of antipodal distance-regular graphs
• On the injective chromatic number of graphs
• Interlacing eigenvalues and graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• New approach to the \(k\)-independence number of a graph
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Approximation of the Stability Number of a Graph via Copositive Programming
• On the Shannon capacity of a graph
• The Chromatic Number of Graph Powers
• The strong chromatic index ofC4-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(k\)-independence number of graphs