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 equality in an upper bound for domination parameters of graphs

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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199703)24:3<221::AID-JGT3>3.0.CO;2-R" /><221::AID-JGT3>3.0.CO;2-R 10.1002/(SICI)1097-0118(199703)24:3<221::AID-JGT3>3.0.CO;2-RzbMath0872.05025OpenAlexW4251312968MaRDI QIDQ3122896

Odile Favaron, Christina M. Mynhardt

Publication date: 7 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)24:3<221::aid-jgt3>3.0.co;2-r


zbMATH Keywords

independence numberdominating setdomination numberirredundance numberirredundant sets


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (6)

Extremal graphs for a new upper bound on domination parameters in graphs ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ Total restrained domination in graphs with minimum degree two ⋮ An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree ⋮ Irredundance ⋮ A survey of stratified domination in graphs







This page was built for publication: On equality in an upper bound for domination parameters of graphs

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