Total domination excellent trees

DOI10.1016/S0012-365X(02)00572-1MaRDI QIDQ1869221zbMATH OpenOpenAlexFDO

Authors Michael A. Henning

Publication date 9 April 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00572-1

zbMATH Keywords

total dominationtree

Mathematics Subject Classification ID

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

Review text

A set \(S\) of vertices of a graph \(G\) is a total dominating set if every vertex of \(G\) is adjacent to some vertex of \(S\) (other than itself). A graph is total domination excellent, denoted by \(\gamma_t\)-excellent, if every vertex belongs to some total dominating set of smallest cardinality. The author shows that the class of \(\gamma_t\)-excellent trees can be constructed recursively by starting with a star and repeatedly applying one of four operations.

Recommendations

• Characterization of total very excellent trees
• Total domination of graphs
• Perfect domination excellent trees
• A note on excellent graphs.
• Restrained domination excellent trees.

Cited in

(10)

• On independent \([1, 2]\)-sets in trees
• Weakly connected domination stable trees.
• Characterization of total very excellent trees
• scientific article; zbMATH DE number 1744072 (Why is no real title available?)
• Roman domination excellent graphs: trees
• Perfect domination excellent trees
• Total domination of graphs
• A note on excellent graphs.
• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent

This page was built for publication: Total domination excellent trees

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