Total domination and matching numbers in claw-free graphs

MaRDI QIDQ2500978zbMATH OpenFDO

Authors Michael A. Henning, A. Yeo

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/126667

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Review text

Summary: A set \(M\) of edges of a graph \(G\) is a matching if no two edges in \(M\) are incident to the same vertex. The matching number of \(G\) is the maximum cardinality of a matching of \(G\). A set \(S\) of vertices in \(G\) is a total dominating set of \(G\) if every vertex of \(G\) is adjacent to some vertex in \(S\). The minimum cardinality of a total dominating set of \(G\) is the total domination number of \(G\). If \(G\) does not contain \(K_{1,3}\) as an induced subgraph, then \(G\) is said to be claw-free. We observe that the total domination number of every claw-free graph with minimum degree at least three is bounded above by its matching number. In this paper, we use transversals in hypergraphs to characterize connected claw-free graphs with minimum degree at least three that have equal total domination and matching numbers.

Recommendations

• On matching and total domination in graphs
• Total domination in claw-free graphs with minimum degree 2
• Upper total domination in claw‐free graphs
• Triangles and (total) domination in subcubic graphs
• scientific article; zbMATH DE number 1885949

Cited in

(15)

• Total domination and matching numbers in graphs with all vertices in triangles
• Triangles and (total) domination in subcubic graphs
• Total restrained domination in claw-free graphs
• d-cluster-free sets with a given matching number
• On matching and semitotal domination in graphs
• On matching and total domination in graphs
• Matchings, path covers and domination
• Comparability on matching and total domination numbers in graphs
• Upper total domination in claw‐free graphs
• Conical and spherical graphs
• On strict strong coloring of graphs
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• Claw-free graphs with equal 2-domination and domination numbers
• On total domination and minimum maximal matchings in graphs
• Cores of simplicial complexes

This page was built for publication: Total domination and matching numbers in claw-free graphs

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