The nonsplit domination number of a graph
From MaRDI portal
Publication:5970167
zbMath0959.05090MaRDI QIDQ5970167
Veerabhadra R. Kulli, Bidarahalli Janakiram
Publication date: 6 August 2000
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Related Items (5)
Maximal 2-rainbow domination number of a graph ⋮ Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths ⋮ PBIB-designs and association schemes arising from minimum bi-connected dominating sets of some special classes of graphs ⋮ Unnamed Item ⋮ The inverse strong nonsplit domination in graphs
This page was built for publication: The nonsplit domination number of a graph
