Opening book details…
Can I read A Lower Bound on the Total Outer-independent Domination Number of a Tree on EtoBox?
A Lower Bound on the Total Outer-independent Domination Number of a Tree by Marcin Krzywkowski is a Mathematics article available to read on EtoBox.
What is A Lower Bound on the Total Outer-independent Domination Number of a Tree about?
A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbour in D, and the set V (G) \ D is independent. The total outer-independent domination number of a graph G, denoted by γ oi t (G), is the minimum cardinality of the total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have γ oi t (T ) (2n -2l + 2)/3, and we characterize the trees attaining this lower bound.
Who reads A Lower Bound on the Total Outer-independent Domination Number of a Tree?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- Marcin Krzywkowski
- Publisher
- Elsevier Science; Elsevier ; Elsevier Masson; Elsevier BV; Cellule MathDoc/CEDRAM (ISSN 1631-073X)
- Published
- 2011
- Language
- EN
- Field
- Mathematics (Physical Sciences)