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

DOI10.1016/J.CRMA.2011.10.005MaRDI QIDQ650849zbMATH OpenOpenAlexFDO

Authors Marcin Krzywkowski

Publication date 7 December 2011

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.crma.2011.10.005

zbMATH Keywords

2-outer-independent dominating set2-outer-independent domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• An upper bound for the double outer-independent domination number of a tree
• An upper bound on the total outer-independent domination number of a tree
• A lower bound on the total outer-independent domination number of a tree
• A lower bound on the double outer-independent domination number of a tree
• On trees with equal 2-domination and 2-outer-independent domination numbers

Cites work

• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 5492426 (Why is no real title available?)
• scientific article; zbMATH DE number 2230941 (Why is no real title available?)
• Bounds for the 2-domination number of toroidal grid graphs
• Double outer-independent domination in graphs.
• Independence and 2-domination in bipartite graphs
• On graphs with equal domination and 2-domination numbers

Cited in

(7)

• Outer-2-independent domination in graphs
• A lower bound on the total outer-independent domination number of a tree
• On trees with equal 2-domination and 2-outer-independent domination numbers
• 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
• An upper bound on the total outer-independent domination number of a tree
• On the ratio between 2-domination and total outer-independent domination numbers of trees

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