The domination number Ξ³(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known that ir(G) β€ Ξ³(G) holds for all graphs G, which leads us to consider the concept of irredundance perfect graphs: graphs that have all their induced subgraphs satisfying th
Irredundance in inflated graphs
β Scribed by Favaron, Odile
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 263 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
The inflation G I of a graph G with n(G) vertices and m(G) edges is obtained by replacing every vertex of degree d of G by a clique K d . We study the lower and upper irredundance parameters ir and IR of an inflation. We prove in particular that if Ξ³ denotes the domination number of a graph, Ξ³(G I ) -ir(G I ) can be arbitrarily large, IR(G I ) β€ m(G) and IR(G I ) β€ n 2 (G)/4. These results disprove a conjecture of Dunbar and Haynes (Congr. Num. 118 (1996), 143-154) and answer another open question.
π SIMILAR VOLUMES
Let Ξ³(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and BollobΓ‘s and Cock- ayne [J. Graph Theory (1979) 241-249] proved independently that Ξ³(G) < 2ir(G) for
One consitlcrs tlic birth and evolution of scalar and tensor gauge-invariant perturbations in "generalized inflationary models", that is cosmological models with a suitable early phase of accelerated expansion. I n this framc the classical analysis that BARDEEN e t al. performed for the standard de