3 citations · 3 across the 5 of their papers we have counts for
5 papers
A novel view: edge isoperimetric methods and reliability evaluation of several kinds of conditional edge-connectivity of interconnection networks
Mingzu Zhang, Zhaoxia Tian, Lianzhu Zhang
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in t…
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…
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…
Minimal sufficient sets of colors and minimum number of colors
Jun Ge, Xian'an Jin, Louis H. Kauffman +2
In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proo…
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimu…