Lianzhu Zhang

According to our database, Lianzhu Zhang authored at least 27 papers between 1997 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

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

CoRR, 2022

2021

Laminar tight cuts in matching covered graphs.

Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang

J. Comb. Theory, Ser. B, 2021

A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks.

Mingzu Zhang, Zhaoxia Tian, Lianzhu Zhang

Proceedings of the 21st IEEE International Conference on Software Quality, 2021

2020

Equivalence classes in matching covered graphs.

Fuliang Lu, Nishad Kothari, Xing Feng, Lianzhu Zhang

Discret. Math., 2020

2019

Disjoint Odd Cycles in Cubic Solid Bricks.

Guantao Chen, Xing Feng, Fuliang Lu, Lianzhu Zhang

SIAM J. Discret. Math., 2019

On structural properties of <i>ABC</i>-minimal chemical trees.

Xiaoxia Wu, Lianzhu Zhang

Appl. Math. Comput., 2019

2018

An O(log₂(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.

Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai

IEEE Trans. Reliab., 2018

An O(|E(G)|²) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs.

Xing Feng, Lianzhu Zhang, Mingzu Zhang

J. Comb. Optim., 2018

Enumeration of perfect matchings of lattice graphs by Pfaffians.

Xing Feng, Lianzhu Zhang, Mingzu Zhang

Appl. Math. Comput., 2018

2017

A Sufficient Condition for Pfaffian Graphs on the Torus.

Xing Feng, Lianzhu Zhang, Mingzu Zhang

Graphs Comb., 2017

A note on the surviving rate of 1-planar graphs.

Jiangxu Kong, Lianzhu Zhang

Discret. Math., 2017

A Conjecture of Norine and Thomas for Abelian Cayley Graphs.

Fuliang Lu, Lianzhu Zhang

Electron. J. Comb., 2017

Spanning trees and recurrent configurations of a graph.

Xiaoxia Wu, Lianzhu Zhang, Haiyan Chen

Appl. Math. Comput., 2017

2016

Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes.

Mingzu Zhang, Lianzhu Zhang, Xing Feng

Theor. Comput. Sci., 2016

2015

The Pfaffian property of circulant graphs.

Fuliang Lu, Lianzhu Zhang, Yan Wang

Discret. Appl. Math., 2015

2014

Pfaffian orientations for a type of bipartite graph.

Fenggen Lin, Lianzhu Zhang, Fuliang Lu

Theor. Comput. Sci., 2014

The Cubic Vertices of Minimal Bricks.

Fenggen Lin, Lianzhu Zhang, Fuliang Lu

J. Graph Theory, 2014

The Pfaffian property of Cartesian products of graphs.

Fuliang Lu, Lianzhu Zhang

J. Comb. Optim., 2014

Structural properties and surviving rate of planar graphs.

Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang

Discret. Math. Algorithms Appl., 2014

The surviving rate of digraphs.

Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang

Discret. Math., 2014

Total chromatic number of generalized Mycielski graphs.

Meirun Chen, Xiaofeng Guo, Hao Li, Lianzhu Zhang

Discret. Math., 2014

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.

Lianzhu Zhang, Weifan Wang, Ko-Wei Lih

Discret. Appl. Math., 2014

2012

The 2-surviving rate of planar graphs without 4-cycles.

Weifan Wang, Jiangxu Kong, Lianzhu Zhang

Theor. Comput. Sci., 2012

Perfect Matchings and Genus of Some Cartesian Products of Graphs.

Fenggen Lin, Lianzhu Zhang, Fuliang Lu

Discret. Math. Algorithms Appl., 2012

2010

Enumeration of Perfect Matchings of a Type of Quadratic Lattice on the Torus.

Fuliang Lu, Lianzhu Zhang, Fenggen Lin

Electron. J. Comb., 2010

2002

Independence and connectivity in 3-domination-critical graphs.

Lianzhu Zhang, Feng Tian

Discret. Math., 2002

1997

The structure of max lambda-min _m+1 graphs used in the design of reliable networks.

Guifang Wang, Lianzhu Zhang

Networks, 1997