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 upper total domination versus upper domination in graphs

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

DOI10.1007/s00373-019-02029-yzbMath1416.05217OpenAlexW2919073589MaRDI QIDQ2000568

Fei Deng, Yongsheng Rao, Chanjuan Liu, En-Qiang Zhu

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02029-y


zbMATH Keywords

subcubic graphsupper domination numberupper total domination number


Mathematics Subject Classification ID

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


Related Items (1)

Mixed domination and 2-independence in trees


Uses Software

  • Graffiti.pc


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Total dominating sequences in graphs
  • A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
  • On the upper total domination number of Cartesian products of graphs
  • A survey of selected recent results on total domination in graphs
  • Total domination versus domination in cubic graphs
  • Total Domination in Graphs with Diameter 2
  • Total domination in graphs
  • Graph Classes: A Survey




This page was built for publication: On upper total domination versus upper domination in graphs

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