Pages that link to "Item:Q501229"
From MaRDI portal
The following pages link to Spectral bounds for the \(k\)-independence number of a graph (Q501229):
Displaying 16 items.
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph (Q984870) (← links)
- Bounds for the independence number in \(k\)-step Hamiltonian graphs (Q1650405) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- The \(k\)-independence number of \(t\)-connected graphs (Q2244182) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- Integer indices and spectral properties for the \(KK_n^j\) graphs (Q2869365) (← links)
- (Q2936700) (← links)
- Spectral Bounds for the k-Regular Induced Subgraph Problem (Q4554522) (← links)
- Spectral upper bound on the quantum k-independence number of a graph (Q5097504) (← links)
- The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
- A unified framework for the expander mixing lemma for irregular graphs and its applications (Q6618703) (← links)
- On trees with given diameter and extremal number of distance-\(k\) independent sets (Q6644074) (← links)
