Edge-splittings preserving local edge-connectivity of graphs
نویسندگان
چکیده
منابع مشابه
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) preserves the local edge-connectivity (the maximum number of pairwise edge disjoint paths) between each pair of vertices in V. The operation splitting off is very useful in graph theory, it is especially powerful in the s...
متن کاملDetachments Preserving Local Edge-Connectivity of Graphs
Let G = (V + s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers with ∑ dj = d(s). An S-detachment splits s into a set of p independent vertices s1, ..., sp with d(sj) = dj , 1 ≤ j ≤ p. Given a requirement function r(u, v) on pairs of vertices of V , an S-detachment is called r-admissible if the detached graph G satisfies λG′(x, y) ≥ r(x, y) for every pair x, y ∈ V . Here λH...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملDetachment of Vertices of Graphs Preserving Edge-Connectivity
The detachment of vertex is the inverse operation of merging vertices s1, . . . , st into s. We speak about {d1, . . . , dt}-detachment if for the detached graph G′ the new degrees are specified as dG′(s1) = d1, . . . , dG′(st) = dt. We call a detachment k-feasible if dG′(X) ≥ k whenever X separates two vertices of V (G)−s. In our main theorem, we give a necessary and sufficient condition for t...
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.05.046