Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

10/22/2021
by   Takehiro Ito, et al.
0

We initiate the study of k-edge-connected orientations of undirected graphs through edge flips for k ≥ 2. We prove that in every orientation of an undirected 2k-edge-connected graph, there exists a sequence of edges such that flipping their directions one by one does not decrease the edge-connectivity, and the final orientation is k-edge-connected. This yields an “edge-flip based” new proof of Nash-Williams' theorem: an undirected graph G has a k-edge-connected orientation if and only if G is 2k-edge-connected. As another consequence of the theorem, we prove that the edge-flip graph of k-edge-connected orientations of an undirected graph G is connected if G is (2k+2)-edge-connected. This has been known to be true only when k=1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2023

Directed hypergraph connectivity augmentation by hyperarc reorientations

The orientation theorem of Nash-Williams states that an undirected graph...
research
12/06/2020

Connectivity of orientations of 3-edge-connected graphs

We attempt to generalize a theorem of Nash-Williams stating that a graph...
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/02/2022

Spectral Rank Monotonicity on Undirected Networks

We study the problem of score and rank monotonicity for spectral ranking...
research
05/20/2020

Edge removal in undirected networks

The edge-removal problem asks whether the removal of a λ-capacity edge f...
research
07/13/2022

Monotonicity in Undirected Networks

Is it always beneficial to create a new relationship (have a new followe...
research
11/27/2019

Graph Representation for Face Analysis in Image Collections

Given an image collection of a social event with a huge number of pictur...

Please sign up or login with your details

Forgot password? Click here to reset