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

On connected cutfree domination in graphs

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

zbMath0772.05054MaRDI QIDQ1200040

J. Paulraj Joseph, S. Arumugam

Publication date: 17 January 1993

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

dominating setdomination numberconnected cutfree domination


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)


Related Items (5)

Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ \(H\)-domination in graphs ⋮ Connected Domination ⋮ Restrained domination in graphs






This page was built for publication: On connected cutfree domination in graphs

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