|
|
| |
| On the Ratio Between 2-Domination and Total Outer-Independent Domination Numbers of Trees |
| |
Citation： |
Marcin KRZYWKOWSKI.On the Ratio Between 2-Domination and Total Outer-Independent Domination Numbers of Trees[J].Chinese Annals of Mathematics B,2013,34(5):765~776 |
| Page view： 1760
Net amount： 1317 |
Authors： |
Marcin KRZYWKOWSKI; |
Foundation： |
Polish Ministry of Science and Higher Education grand IP/2012/038972. |
|
|
| Abstract： |
A 2-dominating set of a graph G is a set D of vertices of G such that every vertex
of V (G) \D has at least two neighbors in D. 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 neighbor in D, and
the set V (G) \D is independent. The 2-domination (total outer-independent domination,
respectively) number of a graph G is the minimum cardinality of a 2-dominating (total
outer-independent dominating, respectively) set of G. We investigate the ratio between
2-domination and total outer-independent domination numbers of trees. |
Keywords： |
2-Domination, Total domination, Total outer-independent domination,
Tree |
Classification： |
05C05, 05C69 |
|
|
Download PDF Full-Text
|
|
|
|
