Name
Abstract | ||
|---|---|---|
We present two heuristics for finding a small power dominating set of cubic graphs. We analyze the performance of these heuristics on random cubic graphs using differential equations. In this way, we prove that the proportion of vertices in a minimum power dominating set of a random cubic graph is asymptotically almost surely at most 0.067801. We also provide a corresponding lower bound of 1/29.7 approximate to 0.03367 using known results on bisection width. (C) 2016 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22053 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
power domination,random cubic graphs | Random regular graph,Discrete mathematics,Dominating set,Indifference graph,Combinatorics,Random graph,Cubic form,Cubic graph,Chordal graph,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
85 | 1 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liying Kang | 1 | 347 | 48.27 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |