Abstract | ||
---|---|---|
The following sequence of inequalities is well-known in domination theory: ir ⩽ γ ⩽ i ⩽ β 0 ⩽ ⌈ ⩽ IR. In this chain, ir and IR are the irredundance and upper irredundance numbers, respectively, γ and ⌈ are the domination and upper domination numbers, and i and β 0 are the independent domination and vertex independence numbers. In this paper we investigate the above chain of inequalities for cubic graphs, i.e., regular graphs of degree 3. We attempt to extend the above chain for cubic graphs by including the parameters γ − , ⌈ − , γs and ⌈ s , where γ − and ⌈ are the minus domination and upper minus domination numbers, respectively, and γ s and ⌈ s are the signed domination and upper signed domination numbers, respectively. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1016/0012-365X(96)00025-8 | Discrete Mathematics |
Keywords | Field | DocType |
domination parameter,cubic graph,domination number,regular graph | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cubic graph,Mathematics | Journal |
Volume | Issue | ISSN |
158 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
35 | 6.44 | 4 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michael A. Henning | 1 | 1865 | 246.94 |
Peter J. Slater | 2 | 593 | 132.02 |