Detachments Preserving Local Edge-Connectivity of Graphs

Let G=(V+s,E) be a graph with a designated vertex s of degree d(s), and let f(s)=(d1,d2,. . .,dp) be a partition of d(s) into p positive integers. An f(s)-detachment of G is a graph G' obtained by "splitting" s into p vertices, called the pieces of s, such that the degrees of the pieces of s in G' are given by f(s). Thus every edge $sw\in E$ corresponds to an edge of G' connecting some piece of s to w. We give necessary and sufficient conditions for the existence of an f(s)-detachment of G in which the local edge-connectivities between pairs of vertices in V satisfy prespecified lower bounds. Our result is a common generalization of a theorem of Mader on edge splittings preserving local edge-connectivities and a result of Fleiner on f(s)-detachments satisfying uniform lower bounds. It implies a conjecture of Fleiner on f(s)-detachments preserving local edge-connectivities. By using our characterization we extend a theorem of Frank on local edge-connectivity augmentation of graphs to the case when stars of given degrees are added, and we also solve the local edge-connectivity augmentation problem for 3-uniform hypergraphs.

[1]  Flemming Friche Rodler Wavelet Based 3D Compression for Very Large Volume Data Supporting Fast Random Access , 1999 .

[2]  András Frank Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[3]  Olivier Danvy,et al.  Lambda-dropping: transforming recursive equations into programs with block structure , 1997, Theor. Comput. Sci..

[4]  C. Nash-Williams,et al.  Connected detachments of graphs and generalized Euler trails , 1985 .

[5]  U. Kohlenbach Foundational and Mathematical Uses of Higher Types , 1999 .

[6]  L. Lovász Combinatorial problems and exercises , 1979 .

[7]  András Frank,et al.  On a theorem of Mader , 1992, Discret. Math..

[8]  Ian Anderson,et al.  Detachments of graphs and generalised Euler trails , 1985 .

[9]  Bill Jackson,et al.  Highly edge-connected detachments of graphs and digraphs , 2003 .

[10]  Søren Riis A complexity gap for tree resolution , 2001, computational complexity.

[11]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[12]  Harold N. Gabow,et al.  Efficient splitting off algorithms for graphs , 1994, STOC '94.

[13]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[14]  W. Mader A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[15]  Luca Aceto,et al.  The max-plus algebra of the natural numbers has no finite equational basis , 1999, Theor. Comput. Sci..

[16]  Luca Aceto,et al.  Is your model checker on time? On the complexity of model checking for timed modal logics , 1999, J. Log. Algebraic Methods Program..