Name
Abstract | ||
|---|---|---|
vertex of a graph is called critical if its deletion decreases the domination number, and an edge is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. In this paper, we show that if G is a connected dot-critical graph with domination number k 3 and diameter d and if G has no critical vertices, then d ≤ 2 k 3. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00373-011-1095-1 | Graphs and Combinatorics |
Keywords | Field | DocType |
05c69,diameter,domination,dot-critical graph | Topology,Discrete mathematics,Combinatorics,Graph toughness,Bound graph,Graph power,Cycle graph,Semi-symmetric graph,Regular graph,Domination analysis,Critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 1 | 1435-5914 |
Citations | PageRank | References |
2 | 0.52 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michitaka Furuya | 1 | 39 | 18.35 |
| Masanori Takatou | 2 | 3 | 1.59 |