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

DOI10.1016/J.DISC.2012.09.024MaRDI QIDQ1928455zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, A. Yeo

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 dominating settotal domination number

Mathematics Subject Classification ID

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

Recommendations

• On matching and total domination in graphs
• Some results on matching and total domination in graphs
• Total domination and matching numbers in claw-free graphs
• On total domination and minimum maximal matchings in graphs
• Matchings and total domination subdivision number in graphs with few induced 4-cycles

Cited in

(7)

• On matching and semitotal domination in graphs
• On matching and total domination in graphs
• The total number of matchings in triangle graph of a connected graph.
• Matchings, path covers and domination
• 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
• On total domination and minimum maximal matchings in graphs

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

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