Fair domination in graphs
From MaRDI portal
Publication:449132
DOI10.1016/j.disc.2012.05.006zbMath1251.05121arXiv1109.1150OpenAlexW2026021893MaRDI QIDQ449132
Michael A. Henning, Yair Caro, Adriana Hansberg
Publication date: 12 September 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1150
Related Items
Induced 2-regular subgraphs in \(k\)-chordal cubic graphs ⋮ \((1, j)\)-set problem in graphs ⋮ Unnamed Item ⋮ Quasiperfect domination in trees ⋮ Unnamed Item ⋮ Coefficient of domination in graph ⋮ On the number of fair dominating sets of graphs ⋮ A note on the fair domination number in outerplanar graphs ⋮ Perfect Italian domination on planar and regular graphs ⋮ Dominating sets for uniform subset graphs ⋮ Connected Fair Domination in Graphs ⋮ Fair domination number in cactus graphs ⋮ \([1,2\)-sets in graphs] ⋮ Fair total domination number in cactus graphs ⋮ Partial domination - the isolation number of a graph ⋮ Irregular independence and irregular domination ⋮ PARTIAL DOMINATION IN THE JOIN, CORONA, LEXICOGRAPHIC AND CARTESIAN PRODUCTS OF GRAPHS ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs ⋮ On perfect and quasiperfect dominations in graphs ⋮ Outer complete fair domination in graphs ⋮ Equitable fair domination in graphs ⋮ Regular independent sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Main eigenvalues and \((\kappa ,\tau )\)-regular sets
- Integral graphs and \((k,\tau )\)-regular sets
- Repetition number of graphs
- Perfect dominating sets in the Cartesian products of prime cycles
- Maximum \(k\)-regular induced subgraphs
- Perfect domination in rectangular grid graphs
- Large Nearly Regular Induced Subgraphs
- Domination-balanced graphs
- Perfect domination in regular grid graphs