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

A new lower bound on the double domination number of a graph

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

DOI10.1016/j.dam.2018.06.009zbMath1404.05152OpenAlexW2811376386WikidataQ129587753 ScholiaQ129587753MaRDI QIDQ1720339

Majid Hajian, Nader Jafari Rad

Publication date: 8 February 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.009


zbMATH Keywords

domination numberdouble domination number


Mathematics Subject Classification ID

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


Related Items (7)

New bounds on the double domination number of trees ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ Double domination in rooted product graphs ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ Double domination in lexicographic product graphs ⋮ Double domination in maximal outerplanar graphs ⋮ Double outer-independent domination number of graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A note on the double domination number in trees
  • On Double Domination in Graphs


This page was built for publication: A new lower bound on the double domination number of a graph

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