The nonsplit domination number of a graph
From MaRDI portal
Publication:1572804
zbMath0959.05091MaRDI QIDQ1572804
Veerabhadra R. Kulli, Bidarahalli Janakiram
Publication date: 26 April 2001
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Related Items (7)
Unnamed Item ⋮ The forcing nonsplit domination number of a graph ⋮ [1,2-Complementary connected domination number of graphs-III] ⋮ The cototal domination number of a graph ⋮ Strong non split r-domination number of a graph ⋮ The strong nonsplit domination polynomial of some graphs ⋮ The nonsplit domination in subdivision graph
This page was built for publication: The nonsplit domination number of a graph