Name
Abstract | ||
|---|---|---|
A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V\S is connected. The outer-connected domination number gamma(c)(G) is the minimum size of such a set. We present an infinite family of 2-connected cubic graphs, in which the number of vertices in a longest path are much less than the half of their orders. This disprove a recent conjecture posed by Akhbari, Hasni, Favaron, Karami, Sheikholeslami. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1142/S1793830914500323 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Domination number, outer-connected domination number, cubic graphs | Discrete mathematics,Dominating set,Combinatorics,Vertex (geometry),Vertex (graph theory),Induced path,Neighbourhood (graph theory),Independent set,Domination analysis,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
6 | 3 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shipeng Wang | 1 | 8 | 5.66 |
| Baoyindureng Wu | 2 | 99 | 24.68 |
| Xinhui An | 3 | 18 | 5.55 |
| Xiaoping Liu | 4 | 933 | 84.29 |
| Xingchao Deng | 5 | 1 | 1.11 |