An upper bound for the double outer-independent domination number of a tree

DOI10.1515/GMJ-2014-0057MaRDI QIDQ2260274zbMATH OpenOpenAlexFDO

Authors Marcin Krzywkowski

Publication date 10 March 2015

Published in Georgian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gmj-2014-0057

zbMATH Keywords

double dominationdouble outer-independent dominationtree

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the double outer-independent domination number of a tree
• An upper bound on the 2-outer-independent domination number of a tree
• An upper bound on the total outer-independent domination number of a tree
• On trees with double domination number equal to 2-domination number plus one
• A lower bound on the total outer-independent domination number of a tree

Cited in

(9)

• On trees with double domination number equal to 2-domination number plus one
• An upper bound on the total outer-independent domination number of a tree
• Double outer-independent domination in graphs.
• A lower bound on the double outer-independent domination number of a tree
• Double outer-independent domination number of graphs
• Lower and upper bounds on independent double Roman domination in trees
• An improved upper bound on the independent double Roman domination number of trees
• 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

This page was built for publication: An upper bound for the double 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 Q2260274)