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

DOI10.1016/J.CRMA.2011.10.005zbMath1236.05150OpenAlexW3023001834MaRDI QIDQ650849

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)

Cites Work

• On graphs with equal domination and 2-domination numbers
• Bounds for the 2-domination number of toroidal grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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