Distance \(r\)-domination number and \(r\)-independence complexes of graphs
From MaRDI portal
Publication:2122691
DOI10.1016/j.ejc.2022.103508zbMath1486.05226arXiv2001.06775OpenAlexW3001827848MaRDI QIDQ2122691
Anurag Singh, Samir Shukla, Priyavrat Deshpande
Publication date: 7 April 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.06775
Relations of low-dimensional topology with graph theory (57M15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Topology of clique complexes of line graphs, Chordal graphs, higher independence and vertex decomposable complexes
Cites Work
- Star clusters in independence complexes of graphs
- Independence complexes of stable Kneser graphs
- A local criterion for Tverberg graphs
- On rigid circuit graphs
- Extremal problems for transversals in graphs with bounded degree
- On the independence complex of square grids
- Independence complexes of chordal graphs
- On the \(r\)-domination number of a graph
- Domination numbers and homology
- Weighted sheaves and homology of Artin groups
- Bounded monochromatic components for random graphs
- Defective and clustered graph colouring
- Generalizations of independence and chromatic numbers of a graph
- Independent systems of representatives in weighted graphs
- Proof of the Lovász conjecture
- Independence complexes of claw-free graphs
- The topology of the independence complex
- Lower Bounds on the Distance Domination Number of a Graph
- Higher Independence Complexes of graphs and their homotopy types
- Combinatorial algebraic topology
- Unnamed Item
- Unnamed Item
- Unnamed Item
