Spectral bounds for the k-independence number of a graph
From MaRDI portal
Publication:501229
Abstract: In this paper, we obtain two spectral upper bounds for the -independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than . We construct graphs that attain equality for our first bound and show that our second bound compares favorably to previous bounds on the -independence number.
Recommendations
- On the \(k\)-independence number of graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Spectral upper bound on the quantum \(k\)-independence number of a graph
- The bounds of spectral radius of graphs with a given size of independent set.
- The optimal bound on the 3-independence number obtainable from a polynomial-type method
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3425628 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 637355 (Why is no real title available?)
- A Cauchy-Davenport type result for arbitrary regular graphs
- A Tight Bound on the Irregularity Strength of Graphs
- Algebraic characterizations of distance-regular graphs
- An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
- An eigenvalue characterization of antipodal distance-regular graphs
- Average degree in graph powers
- Broadcast chromatic numbers of graphs
- Eigenvalue interlacing and weight parameters of graphs
- Explicit construction of linear sized tolerant networks
- Independence and average distance in graphs
- Interlacing eigenvalues and graphs
- Laplacian eigenvalues of the second power of a graph
- Large 2-independent sets of regular graphs
- Locally pseudo-distance-regular graphs
- On the $b$ -Independence Number of Sparse Random Graphs
- On the injective chromatic number of graphs
- Pseudo-random graphs
- Spectra of graphs
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- The alternating polynomials and their relation with the spectra and conditional diameters of graphs
- The strong chromatic index ofC4-free graphs
Cited in
(17)- Laplacian spectral bounds for clique and independence numbers of graphs
- The optimal bound on the 3-independence number obtainable from a polynomial-type method
- On the \(k\)-independence number of graphs
- On trees with given diameter and extremal number of distance-\(k\) independent sets
- Spectral Bounds for the k-Regular Induced Subgraph Problem
- The \(k\)-independence number of \(t\)-connected graphs
- Bounds for the independence number in \(k\)-step Hamiltonian graphs
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- A unified framework for the expander mixing lemma for irregular graphs and its applications
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- Integer indices and spectral properties for the \(KK_n^j\) graphs
- The bounds of spectral radius of graphs with a given size of independent set.
- scientific article; zbMATH DE number 6383843 (Why is no real title available?)
- Spectral upper bound on the quantum \(k\)-independence number of a graph
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph
This page was built for publication: Spectral bounds for the \(k\)-independence number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501229)
