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

The rati of the irredundance and domination number of a graph

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

DOI10.1016/S0012-365X(97)81829-8zbMath0888.05037MaRDI QIDQ1377839

Lutz Volkmann

Publication date: 1 June 1998

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


zbMATH Keywords

cyclomatic numberblock graphdomination numberirredundance number


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (4)

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



Cites Work

  • Irredundance number versus domination number
  • Graph-theoretic parameters concerning domination, independence, and irredundance
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: The rati of the irredundance and domination number of a graph

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