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

On parameters related to strong and weak domination in graphs

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

DOI10.1016/S0012-365X(02)00257-1zbMath1007.05075MaRDI QIDQ1850037

Gayla S. Domke, Johannes H. Hattingh, Elna Ungerer, Lisa R. Markus

Publication date: 2 December 2002

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


zbMATH Keywords

triangle-free graphstrong dominationweak domination


Mathematics Subject Classification ID

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


Related Items (7)

Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs ⋮ ON WEAK DOMINATION NUMBER OF SOME GRAPHS ⋮ SOME RESULTS ON WEAK DOMINATION IN GRAPHS ⋮ On strong (weak) independent sets and vertex coverings of a graph ⋮ Independent strong domination in complementary prisms ⋮ The strong domination problem in block graphs and proper interval graphs ⋮ Independent strong weak domination: A mathematical programming approach







This page was built for publication: On parameters related to strong and weak domination in graphs

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