Loading...
Please wait, while we are loading the content...
Similar Documents
Offensive alliances in cubic graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Rodríguez, Jairo Arbey Sigarreta, Jose Maria |
| Copyright Year | 2006 |
| Abstract | An offensive alliance in a graph Γ = (V, E) is a set of vertices S ⊂ V where for every vertex v in its boundary it holds that the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V \S, that is, S is a dominating set of Γ. The global offensive alliance number γo(Γ) (respectively, global strong offensive alliance number γˆ(Γ)) is the minimum cardinality of a global offensive (respectively, global strong offensive) alliance in Γ. If Γ has global independent offensive alliances, then the global independent offensive alliance number γi(Γ) is the minimum cardinality among all independent global offensive alliances of Γ. In this paper we study mathematical properties of the global (strong) alliance number of cubic graphs. For instance, we show that for all connected cubic graph of order n, 2n 5 ≤ γi(Γ) ≤ |
| File Format | PDF HTM / HTML |
| DOI | 10.12988/imf.2006.06152 |
| Alternate Webpage(s) | http://www.m-hikari.com/imf-password/33-36-2006/rodriguez-velazquezIMF33-36-2006.pdf |
| Alternate Webpage(s) | http://arxiv.org/pdf/math/0610023v1.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Juan_Alberto_Rodriguez-Velazquez/publication/233844817_Offensive_alliances_in_cubic_graphs/links/0912f50c0e0f1400b0000000.pdf |
| Alternate Webpage(s) | https://arxiv.org/pdf/math/0610023v1.pdf |
| Alternate Webpage(s) | https://doi.org/10.12988/imf.2006.06152 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
