4 papers
A concentration phenomenon for -extra edge-connectivity reliability analysis of enhanced hypercubes with exponentially many faulty links
Yali Sun, Mingzu Zhang, Xing Feng +1
Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The -enhanced hypercube , as a variation of…
Laminar Tight Cuts in Matching Covered Graphs
Guantao Chen, Xing Feng, Fuliang Lu +2
An edge cut of a graph is {\it tight} if for every perfect matching of .~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…
-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
Fuliang Lu, Xing Feng, Yan Wang
A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge in a brick $G…
Equivalence classes in matching covered graphs
Fuliang Lu, Nishad Kothari, Xing Feng +1
A connected graph , of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph yields a list of brick…