Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The nonsplit domination number of a graph

From MaRDI portal
Publication:1572804
Jump to:navigation, search

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)


zbMATH Keywords

domination setnonsplit domination number


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1572804&oldid=13855778"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 01:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki