Extremality and Sharp Bounds for the k-edge-connectivity of Graphs

01/18/2019
by   Yuefang Sun, et al.
0

Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version of the generalized edge-connectivity, named k-edge-connectivity. For any integer k with 2≤ k≤ n, the k-edge-connectivity of a graph G, denoted by λ_k(G), is defined as the smallest number of edges whose removal from G produces a graph with at least k components. In this paper, we first compute some exact values and sharp bounds for λ_k(G) in terms of n and k. We then discuss the relationships between λ_k(G) and other generalized connectivities. An algorithm in O(n^2) time will be provided such that we can get a sharp upper bound in terms of the maximum degree. Among our results, we also compute some exact values and sharp bounds for the function f(n,k,t) which is defined as the minimum size of a connected graph G with order n and λ_k(G)=t.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2020

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

A 2-edge-colored graph or a signed graph is a simple graph with two type...
research
01/22/2022

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs

Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2≤ k≤...
research
03/12/2022

An edge centrality measure based on the Kemeny constant

A new measure c(e) of the centrality of an edge e in an undirected graph...
research
02/09/2020

Edge-Isoperimetric Inequalities and Ball-Noise Stability: Linear Programming and Probabilistic Approaches

Let Q_n^r be the r-power of the hypercube {-1,1}^n. The discrete edge-is...
research
08/14/2019

Light edges in 1-planar graphs of minimum degree 3

A graph is 1-planar if it can be drawn in the plane so that each edge is...
research
11/02/2019

On Connectivity and Robustness in Random Intersection Graphs

Random intersection graphs have received much attention recently and bee...

Please sign up or login with your details

Forgot password? Click here to reset