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

Irredundance number versus domination number

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

DOI10.1016/0012-365X(91)90403-OzbMath0753.05068WikidataQ126634647 ScholiaQ126634647MaRDI QIDQ1176738

Peter Damaschke

Publication date: 25 June 1992

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


zbMATH Keywords

domination numberirredundance number


Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)


Related Items

Irredundance perfect graphs ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ The rati of the irredundance and domination number of a graph ⋮ Laplacian distribution and domination ⋮ Partial domination and irredundance numbers in graphs ⋮ Dominating sets, packings, and the maximum degree ⋮ Irredundance ⋮ On the ratios between packing and domination parameters of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Graph-theoretic parameters concerning domination, independence, and irredundance
  • Stability, domination and irredundance in a graph
  • Properties of Hereditary Hypergraphs and Middle Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1176738&oldid=12006046"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki