Name
Abstract | ||
|---|---|---|
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in¿ S . The independent domination number of G , denoted by¿ i ( G ) , is the minimum cardinality of an independent dominating set of G . In this paper, we show that if G is a bipartite cubic graph of order¿ n and of girth at least¿ 6 , then i ( G ) ¿ 4 n / 11 . |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2013.08.035 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Independent domination,Cubic graphs | Journal | 162 |
Issue | ISSN | Citations |
C | 0166-218X | 1 |
PageRank | References | Authors |
0.37 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael A. Henning | 1 | 1865 | 246.94 |
| Christian Löwenstein | 2 | 131 | 16.28 |
| Dieter Rautenbach | 3 | 946 | 138.87 |