Minimally (k, k-1)-edge-connected graphs
نویسندگان
چکیده
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the paper. Bounds of size of such graphs with given order are discussed.
منابع مشابه
On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملA new algorithm to determine minimally k-edge- connected graphs with odd k
A necessary and sufficient condition for a graph to be minimally k-edge-connected where k is odd is presented. Based on this result, a divide-and-conquer algorithm to determine minimally k-edge-connected graphs is developed. Experiments are performed to check minimally 3-edge-connectivity. The results show that our algorithm is much more effective than the previously known best algorithm.
متن کاملNote on minimally k-connected graphs
A k-tree is either a complete graph on (k+1) vertices or given a k-tree G′ with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G′ and then joining each vertex u in Q. A graph G is kedge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A k-edge-connected graph G is said to be m...
متن کاملMinimally k-Edge-Connected Directed Graphs of Maximal Size
Let D = (V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V | ≥ f(k) implies |E| ≤ 2k(|V | − k). We also determine the extremal graphs whose size attains this upper bound.
متن کاملThe Laplacian Polynomial and Kirchhoff Index of the k-th Semi Total Point Graphs
The k-th semi total point graph of a graph G, , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. In this paper, a formula for Laplacian polynomial of in terms of characteristic and Laplacian polynomials of G is computed, where is a connected regular graph.The Kirchhoff index of is also computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 2003