Partial domination - the isolation number of a graph
From MaRDI portal
Publication:5162046
DOI10.2298/FIL1712925CzbMath1488.05367arXiv1504.08055OpenAlexW2963808569WikidataQ130106194 ScholiaQ130106194MaRDI QIDQ5162046
Publication date: 1 November 2021
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.08055
Related Items
Isolation of the diamond graph ⋮ Isolation of \(k\)-cliques. II ⋮ Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ Isolation of cycles ⋮ Isolation of \(k\)-cliques ⋮ \( P_5\)-isolation in graphs ⋮ Isolation of connected graphs ⋮ A sharp upper bound on the cycle isolation number of graphs ⋮ Partial domination and irredundance numbers in graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ \(K_{1, 2}\)-isolation number of claw-free cubic graphs ⋮ Cycle isolation of graphs with small girth ⋮ A note on the cycle isolation number of graphs ⋮ Graphs with isolation number equal to one third of the order ⋮ Extensions of the Art Gallery Theorem ⋮ Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph ⋮ Unnamed Item ⋮ \( K_{1 , 2}\)-isolation in graphs ⋮ Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)] ⋮ Admissible property of graphs in terms of radius ⋮ Isolation number of maximal outerplanar graphs ⋮ Admissible property of graphs in terms of independence number
Cites Work
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
- Fair domination in graphs
- Computing the domination number of grid graphs
- Connected domination number of a graph and its complement
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- On dominating sets of maximal outerplanar graphs
- New approach to the \(k\)-independence number of a graph
- Bounds on the connected domination number of a graph
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- A generalised upper bound for the \(k\)-tuple domination number
- High degree graphs contain large-star factors
- The Domination Number of Grids
- Domination in graphs with minimum degree two
- Onk-domination and minimum degree in graphs
- Connected Domination and Spanning Trees with Many Leaves
- Graphs with large total domination number
- Total Domination in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
