A graph G is domination edge critical, or just gamma-edge critical, if for any edge e not in G. gamma(G + e) < gamma(G). We will characterize all connected gamma-edge critical cactus graphs. (C) 2011 Published by Elsevier Masson SAS on behalf of Academie des sciences.
机构:
Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa
Desormeaux, Wyatt J.
Haynest, Teresa W.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa
East Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USAUniv Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa
Haynest, Teresa W.
van der Merwe, Lucas
论文数: 0引用数: 0
h-index: 0
机构:
Univ Tennessee, Dept Math, 615 McCallie Ave, Chattanooga, TN 37403 USAUniv Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa