Domination and independence subdivision numbers of graphs
From MaRDI portal
Publication:2725191
DOI10.7151/dmgt.1126zbMath0984.05066OpenAlexW2033476199MaRDI QIDQ2725191
Sandra M. Hedetniemi, Teresa W. Haynes, Stephen T. Hedetniemi
Publication date: 24 March 2002
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a7b29a22474a88d25b9a68ae5335ad25f240424b
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Semitotal domination subdivision numbers of graphs ⋮ Total domination subdivision numbers of trees ⋮ Open packing subdivision number of graphs ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ Coronas and domination subdivision number of a graph ⋮ On the 2-independence subdivision number of graphs ⋮ Independent domination subdivision in graphs ⋮ Secure domination subdivision number of a graph ⋮ Domination subdivision and domination multisubdivision numbers of graphs
This page was built for publication: Domination and independence subdivision numbers of graphs