Lianzhu Zhang

According to our database1, Lianzhu Zhang authored at least 21 papers between 1997 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.
IEEE Trans. Reliability, 2018

An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs.
J. Comb. Optim., 2018

Enumeration of perfect matchings of lattice graphs by Pfaffians.
Applied Mathematics and Computation, 2018

2017
A Sufficient Condition for Pfaffian Graphs on the Torus.
Graphs and Combinatorics, 2017

A note on the surviving rate of 1-planar graphs.
Discrete Mathematics, 2017

A Conjecture of Norine and Thomas for Abelian Cayley Graphs.
Electr. J. Comb., 2017

Spanning trees and recurrent configurations of a graph.
Applied Mathematics and Computation, 2017

2016
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes.
Theor. Comput. Sci., 2016

2015
The Pfaffian property of circulant graphs.
Discrete Applied Mathematics, 2015

2014
Pfaffian orientations for a type of bipartite graph.
Theor. Comput. Sci., 2014

The Cubic Vertices of Minimal Bricks.
Journal of Graph Theory, 2014

The Pfaffian property of Cartesian products of graphs.
J. Comb. Optim., 2014

Structural properties and surviving rate of planar graphs.
Discrete Math., Alg. and Appl., 2014

The surviving rate of digraphs.
Discrete Mathematics, 2014

Total chromatic number of generalized Mycielski graphs.
Discrete Mathematics, 2014

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.
Discrete Applied Mathematics, 2014

2012
The 2-surviving rate of planar graphs without 4-cycles.
Theor. Comput. Sci., 2012

Perfect Matchings and Genus of Some Cartesian Products of Graphs.
Discrete Math., Alg. and Appl., 2012

2010
Enumeration of Perfect Matchings of a Type of Quadratic Lattice on the Torus.
Electr. J. Comb., 2010

2002
Independence and connectivity in 3-domination-critical graphs.
Discrete Mathematics, 2002

1997
The structure of max lambda-min m+1 graphs used in the design of reliable networks.
Networks, 1997


  Loading...