Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
نویسندگان
چکیده
منابع مشابه
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
For a connected graphG= (V ,E), an edge set S ⊂ E is a k-restricted-edge-cut, ifG−S is disconnected and every component of G− S has at least k vertices. The k-restricted-edge-connectivity of G, denoted by k(G), is defined as the cardinality of a minimum k-restricted-edge-cut. The k-isoperimetric-edge-connectivity is defined as k(G)=min{|[U,U ]| : U ⊂ V, |U | k, |U | k}, where [U,U ] is the set ...
متن کاملRestricted edge connectivity and restricted connectivity of graphs
Let G = (V, E) be a connected graph. Let G = (V, E) be a connected graph. An edge set F ⊂ E is said to be a k-restricted edge cut, if G− F is disconnected and every component of G− F has at least k vertices. The k-restricted edge connectivity of G, denoted by λk(G), is the cardinality of a minimum k-restricted edge cut of G. A graph G is λk-connected, if G contains a k-restricted edge cut. A λk...
متن کاملInverse degree and edge-connectivity
Let G be a connected graph with vertex set V (G), order n = |V (G)|, minimum degree δ and edge-connectivity λ. Define the inverse degree of G as R(G) = ∑ v∈V (G) 1 d(v) , where d(v) denotes the degree of the vertex v. We show that if R(G) < 2 + 2 δ(δ + 1) + n− 2δ (n− δ − 2)(n− δ − 1) , then λ = δ. We also give an analogous result for triangle-free graphs.
متن کاملDegree distance and edge-connectivity
Let G be a finite connected graph. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u + deg v) dG(u, v), where degw is the degree of vertex w and dG(u, v) denotes the distance between u and v in G. In this paper, we give asymptotically sharp upper bounds on the degree distance in terms of order and edge-connectivity.
متن کاملRestricted Edge-Connectivity of de Bruijn Digraphs
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of interconnection networks. This paper determines that the restricted edge-connectivity of the de Bruijn digraph B(d, n) is equal to 2d − 2 for d ≥ 2 and n ≥ 2 except B(2, 2). As consequences, the super edge-connectedness of B(d, n) is obtained immediately.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.06.028