Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Total k-domination number in graphs

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

zbMATH Open1145.05046MaRDI QIDQ5437268FDOQ5437268


Authors: Weiliang Zhao, Haichao Wang, Guangjun Xu Edit this on Wikidata


Publication date: 18 January 2008





Recommendations

  • On the total \(k\)-domination in graphs
  • Total 2-domination in grid graphs
  • Total $k$-domination in strong product graphs
  • Total \(k\)-domination in Cartesian product graphs
  • A note on graphs with largest total \(k\)-domination number.


Mathematics Subject Classification ID

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



Cited In (7)

  • Game $k$-Domination Number of Graphs
  • On k-Total Dominating Graphs
  • The minus total k-domination numbers in graphs
  • Total \(\alpha\)-domination in graphs
  • On the total \(k\)-domination in graphs
  • Total dominator chromatic number of Kneser graphs
  • Total domination number of the conjunction of graphs





This page was built for publication: Total \(k\)-domination number in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437268)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5437268&oldid=20194529"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 03:06. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki