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

On the forcing domination and the forcing total domination numbers of a graph

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

DOI10.1007/s00373-022-02521-yzbMath1495.05226OpenAlexW4291327268MaRDI QIDQ2165253

Yanyan Li

Publication date: 19 August 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02521-y


zbMATH Keywords

domination numbertotal domination numberforcing domination numberforcing total domination number


Mathematics Subject Classification ID

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


Related Items (2)

THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A survey of selected recent results on total domination in graphs
  • A new upper bound on the total domination number of a graph
  • Total domination in graphs




This page was built for publication: On the forcing domination and the forcing total domination numbers of a graph

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