An upper bound on the total outer-independent domination number of a tree

DOI10.7494/OPMATH.2012.32.1.153MaRDI QIDQ2901940zbMATH OpenFDO

Authors Marcin Krzywkowski

Publication date 31 July 2012

Published in Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

total dominationtotal outer-independent domination

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the total outer-independent domination number of a tree
• An upper bound on the 2-outer-independent domination number of a tree
• An upper bound for the double outer-independent domination number of a tree
• A lower bound on the double outer-independent domination number of a tree
• Total outer-connected domination in trees

Cited in

(11)

• Outer independent global dominating set of trees and unicyclic graphs
• An upper bound for the double outer-independent domination number of a tree
• On trees with equal domination and total outer-independent domination numbers
• A note on total co-independent domination in trees
• Total outer-connected domination numbers of trees
• A note on the total outer-connected domination number of a tree
• On the ratio between 2-domination and total outer-independent domination numbers of trees
• A lower bound on the double outer-independent domination number of a tree
• A lower bound on the total outer-independent domination number of a tree
• An upper bound on the 2-outer-independent domination number of a tree
• On trees attaining an upper bound on the total domination number

This page was built for publication: An upper bound on the total outer-independent domination number of a tree

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