Split Domination, Independence, and Irredundance in Graphs
From MaRDI portal
Publication:2971222
zbMath1360.05114arXiv1605.03151MaRDI QIDQ2971222
Stephen T. Hedetniemi, Fiona Knoll, Renu C. Laskar
Publication date: 4 April 2017
Full work available at URL: https://arxiv.org/abs/1605.03151
Related Items (2)
Chordal graphs and upper irredundance, upper domination and independence ⋮ Regular tournaments with minimum split domination number and cycle extendability
This page was built for publication: Split Domination, Independence, and Irredundance in Graphs