On total domination and support vertices of a tree

zbMATH Open1223.05219MaRDI QIDQ547540FDOQ547540

Authors: Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller 

Publication date: 4 July 2011

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

Recommendations

• On trees attaining an upper bound on the total domination number
• Total and paired-domination numbers of a tree
• Bounds on the disjunctive total domination number of a tree
• A note on the total domination number of a tree
• An upper bound on the total restrained domination number of a tree

zbMATH Keywords

treestotal dominating settotal domination numbervertex coverleavesisolated verticessupport verticestotal domination ratio

Mathematics Subject Classification ID

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

Cited In (8)

• Total domination number of central trees
• A new lower bound on the total domination number of a tree.
• Total 2-rainbow domination numbers of trees
• Bounds on the disjunctive total domination number of a tree
• Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
• Total domination versus total outer connected domination in trees
• An improved upper bound on the domination number of a tree
• Total and paired-domination numbers of a tree

Uses Software

• Graffiti.pc

This page was built for publication: On total domination and support vertices of a tree

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