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

Restricted domination in graphs

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

DOI10.1016/S0012-365X(01)00371-5zbMath1004.05043OpenAlexW2075061464MaRDI QIDQ1613539

Michael A. Henning

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00371-5


zbMATH Keywords

domination number


Mathematics Subject Classification ID

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


Related Items (9)

Domination number in graphs with minimum degree two ⋮ Restricted domination in graphs with minimum degree 2 ⋮ Girth and total domination in graphs ⋮ Restricted power domination and zero forcing problems ⋮ Restricted domination parameters in graphs ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ Restricted total domination in graphs ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ Domination versus total domination in claw-free cubic graphs




This page was built for publication: Restricted domination in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1613539&oldid=13912932"
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 03:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki