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

Total domination and matching numbers in graphs with all vertices in triangles

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

DOI10.1016/j.disc.2012.09.024zbMath1256.05171OpenAlexW2029155918MaRDI QIDQ1928455

Anders Yeo, Michael A. Henning

Publication date: 3 January 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.09.024


zbMATH Keywords

matching numbertotal domination numbertotal dominating set


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (5)

Matchings, path covers and domination ⋮ On total domination and minimum maximal matchings in graphs ⋮ On matching and semitotal domination in graphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ A note on lower bounds for the total domination number of digraphs




This page was built for publication: Total domination and matching numbers in graphs with all vertices in triangles

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