Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree

A balloon in a graph G is a maximal 2-edge-connected subgraph incident to exactly one cut-edge of G. Let b(G) be the number of balloons, let c(G) be the number of cut-edges, and let [alpha][prime](G) be the maximum size of a matching. Let be the family of connected (2r+1)-regular graphs with n vertices, and let . For , we prove the sharp inequalities c(G)[les][r(n-2)-2]/(2r2+2r-1)-1 and [alpha][prime](G)[ges]n/2-rb/(2r+1). Using b[les][(2r-1)n+2]/(4r2+4r-2), we obtain a simple proof of the bound proved by Henning and Yeo. For each of these bounds and each r, the approach using balloons allows us to determine the infinite family where equality holds. For the total domination number [gamma]t(G) of a cubic graph, we prove [gamma]t(G)[les]n/2-b(G)/2 (except that [gamma]t(G) may be n/2-1 when b(G)=3 and the balloons cover all but one vertex). With [alpha][prime](G)[ges]n/2-b(G)/3 for cubic graphs, this improves the known inequality [gamma]t(G)[les][alpha][prime](G). © 2009 Wiley Periodicals, Inc. J Graph Theory

Published by

Original source : http://dx.doi.org/10.1002%2Fjgt.20443...