On total domination and support vertices of a tree

MaRDI QIDQ547540zbMATH OpenFDO

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)

zbMATH Keywords

isolated verticesleavessupport verticestotal dominating settotal domination numbertotal domination ratiotreesvertex cover

Mathematics Subject Classification ID

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

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

Cited in

(8)

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

Describes a project that uses

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)