Pages that link to "Item:Q1363759"
From MaRDI portal
The following pages link to Independence and average distance in graphs (Q1363759):
Displaying 13 items.
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- Average distance and generalised packing in graphs (Q708381) (← links)
- Average distances and distance domination numbers (Q1028442) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- A new approach on locally checkable problems (Q2127611) (← 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)
- 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)
- (Q4633026) (← 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)