# Heping Zhang

According to our database

Collaborative distances:

^{1}, Heping Zhang authored at least 126 papers between 1993 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Counting Clar structures of (4, 6)-fullerenes.

Applied Mathematics and Computation, 2019

2018

Upper bounds on the bondage number of the strong product of a graph and a tree.

Int. J. Comput. Math., 2018

Sharp upper bounds on the Clar number of fullerene graphs.

Discussiones Mathematicae Graph Theory, 2018

Anti-forcing polynomials for benzenoid systems with forcing edges.

Discrete Applied Mathematics, 2018

Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures.

Discrete Applied Mathematics, 2018

Hamiltonian laceability in hypercubes with faulty edges.

Discrete Applied Mathematics, 2018

Matching preclusion for n-grid graphs.

Discrete Applied Mathematics, 2018

The isolated-pentagon rule and nice substructures in fullerenes.

Ars Math. Contemp., 2018

Construction for Trees without vertices contained in all minimum dominating sets.

Ars Comb., 2018

2017

Anti-forcing spectra of perfect matchings of graphs.

J. Comb. Optim., 2017

Tight upper bound on the maximum anti-forcing numbers of graphs.

Discrete Mathematics & Theoretical Computer Science, 2017

Per-spectral characterizations of some bipartite graphs.

Discussiones Mathematicae Graph Theory, 2017

A negative answer to a problem on generalized Fibonacci cubes.

Discrete Mathematics, 2017

On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes.

Discrete Applied Mathematics, 2017

Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs.

Discrete Applied Mathematics, 2017

Single coronoid systems with an anti-forcing edge.

Discrete Applied Mathematics, 2017

Extremal anti-forcing numbers of perfect matchings of graphs.

Discrete Applied Mathematics, 2017

NP-completeness of anti-Kekulé and matching preclusion problems.

CoRR, 2017

modSaRa: a computationally efficient R package for CNV identification.

Bioinformatics, 2017

2016

3-Factor-Criticality of Vertex-Transitive Graphs.

Journal of Graph Theory, 2016

Complete forcing numbers of primitive coronoids.

J. Comb. Optim., 2016

Int. J. Comput. Math., 2016

Small Matchings Extend to Hamiltonian Cycles in Hypercubes.

Graphs and Combinatorics, 2016

Proofs of two conjectures on generalized Fibonacci cubes.

Eur. J. Comb., 2016

A maximum resonant set of polyomino graphs.

Discussiones Mathematicae Graph Theory, 2016

Extremal matching energy of complements of trees.

Discussiones Mathematicae Graph Theory, 2016

The bondage number of the strong product of a complete graph with a path and a special starlike tree.

Discrete Math., Alg. and Appl., 2016

A minimax result for perfect matchings of a polyomino graph.

Discrete Applied Mathematics, 2016

Per-spectral and adjacency spectral characterizations of a complete graph removing six edges.

Discrete Applied Mathematics, 2016

Matching preclusion for vertex-transitive networks.

Discrete Applied Mathematics, 2016

Anti-forcing numbers of perfect matchings of graphs.

Discrete Applied Mathematics, 2016

Fullerenes with the maximum Clar number.

Discrete Applied Mathematics, 2016

4-Factor-Criticality of Vertex-Transitive Graphs.

Electr. J. Comb., 2016

Forcing polynomials of benzenoid parallelogram and its related benzenoids.

Applied Mathematics and Computation, 2016

Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial.

Applied Mathematics and Computation, 2016

2015

Solution to a conjecture on words that are bad and 2-isometric.

Theor. Comput. Sci., 2015

Complete forcing numbers of catacondensed hexagonal systems.

J. Comb. Optim., 2015

Matchings extend to Hamiltonian cycles in k-ary n-cubes.

Inf. Sci., 2015

2-resonant fullerenes.

Eur. J. Comb., 2015

Non-matchable distributive lattices.

Discrete Mathematics, 2015

Computing Affine Combinations, Distances, and Correlations for Recursive Partition Functions.

CoRR, 2015

Modified screening and ranking algorithm for copy number variation detection.

Bioinformatics, 2015

Some analytical properties of the permanental polynomial of a graph.

Ars Comb., 2015

Two types of matchings extend to Hamiltonian cycles in hypercubes.

Ars Comb., 2015

Matching extension in toroidal quadrangulations II: the 3-extendable case.

Australasian J. Combinatorics, 2015

2014

Hyper-Hamiltonian laceability of balanced hypercubes.

The Journal of Supercomputing, 2014

Clar Structure and Fries Set of Fullerenes and (4, 6)-Fullerenes on Surfaces.

J. Applied Mathematics, 2014

A note on the permanental roots of bipartite graphs.

Discussiones Mathematicae Graph Theory, 2014

Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges.

Discrete Mathematics, 2014

Decomposition theorem on matchable distributive lattices.

Discrete Applied Mathematics, 2014

On the global forcing number of hexagonal systems.

Discrete Applied Mathematics, 2014

Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces.

Electr. J. Comb., 2014

Fibonacci (p, r)-cubes which are partial cubes.

Ars Comb., 2014

5-factor-critical graphs on the torus.

Ars Comb., 2014

2013

A left cerebellar pathway mediates language in prematurely-born young adults.

NeuroImage, 2013

Discrete Mathematics, 2013

Super restricted edge-connectivity of graphs with diameter 2.

Discrete Applied Mathematics, 2013

Fibonacci (p, r)-cubes which are median graphs.

Discrete Applied Mathematics, 2013

Matching extension in quadrangulations of the torus.

Australasian J. Combinatorics, 2013

2012

Matching preclusion for balanced hypercubes.

Theor. Comput. Sci., 2012

Some Indices of Alphabet Overlap Graph.

J. Comput. Sci. Technol., 2012

On the restricted matching extension of graphs on the torus and the Klein bottle.

Discrete Mathematics, 2012

Computing the permanental polynomials of bipartite graphs by Pfaffian orientation.

Discrete Applied Mathematics, 2012

On the restricted matching extension of graphs in surfaces.

Appl. Math. Lett., 2012

2011

The use of classification trees for bioinformatics.

Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 2011

Sex differences in grey matter atrophy patterns among AD and aMCI patients: Results from ADNI.

NeuroImage, 2011

Determining which Fibonacci (p, r)-cubes can be Z-transformation graphs.

Discrete Mathematics, 2011

2-extendability and k-resonance of non-bipartite Klein-bottle polyhexes.

Discrete Applied Mathematics, 2011

On forcing matching number of boron-nitrogen fullerene graphs.

Discrete Applied Mathematics, 2011

l

_{1}-Embeddability of Hexagonal and Quadrilateral Mobius graphs.
Ars Comb., 2011

On Diameter Stability of the Johnson Graph.

Ars Comb., 2011

2010

Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph.

Order, 2010

Some results on Laplacian spectral radius of graphs with cut vertices.

Discrete Mathematics, 2010

Maximally resonant polygonal systems.

Discrete Mathematics, 2010

Forcing matching numbers of fullerene graphs.

Discrete Applied Mathematics, 2010

2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes.

Discrete Applied Mathematics, 2010

Embeddability of open-ended carbon nanotubes in hypercubes.

Comput. Geom., 2010

Maximal conditional chi-square importance in random forests.

Bioinformatics, 2010

A note on path factors in claw-free graphs.

Ars Comb., 2010

Smallest generalized cuts and diameter-increasing sets of Johnson graphs.

Ars Comb., 2010

2009

On k-Resonant Fullerene Graphs.

SIAM J. Discrete Math., 2009

Minimal 2-matching-covered graphs.

Discrete Mathematics, 2009

Characterizations for P>=2-factor and P>=3-factor covered graphs.

Discrete Mathematics, 2009

Fibonacci-like cubes as Z-transformation graphs.

Discrete Mathematics, 2009

Discrete Mathematics, 2009

Kirchhoff index of composite graphs.

Discrete Applied Mathematics, 2009

Extremal fullerene graphs with the maximum Clar number.

Discrete Applied Mathematics, 2009

2-extendability of toroidal polyhexes and Klein-bottle polyhexes.

Discrete Applied Mathematics, 2009

Willows: a memory efficient tree and forest construction package.

BMC Bioinformatics, 2009

The Laplacian spectral radius of unicyclic graphs with k pendent vertices.

Ars Comb., 2009

A Note on Path-Matchings.

Ars Comb., 2009

2008

Energy conservation in wireless sensor networks and connectivity of graphs.

Theor. Comput. Sci., 2008

Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems.

SIAM J. Discrete Math., 2008

The Hosoya polynomial decomposition for hexagonal chains.

Mathematical and Computer Modelling, 2008

Path-comprehensive and vertex-pancyclic properties of super line graph

*I*.
Discrete Mathematics, 2008

Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system.

Discrete Applied Mathematics, 2008

None of the coronoid systems can be isometrically embedded into a hypercube.

Discrete Applied Mathematics, 2008

The Hosoya polynomial decomposition for catacondensed benzenoid graphs.

Discrete Applied Mathematics, 2008

Hosoya polynomials under gated amalgamations.

Discrete Applied Mathematics, 2008

LOT: a tool for linkage analysis of ordinal traits for pedigree data.

Bioinformatics, 2008

2007

Networks, 2007

A characterization of the interval distance monotone graphs.

Discrete Mathematics, 2007

Resonance of Plane Bipartite Graphs.

Ars Comb., 2007

A min-max result on outerplane bipartite graphs.

Appl. Math. Lett., 2007

2006

Construction for bicritical graphs and

*k*-extendable bipartite graphs.
Discrete Mathematics, 2006

2005

Case Report: A High Productivity/Low Maintenance Approach to High-performance Computation for Biomedicine: Four Case Studies.

JAMIA, 2005

k-factor-covered Regular Graphs.

Ars Comb., 2005

Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs.

Proceedings of the Discrete Geometry, 2005

2004

*Z*-transformation graphs of perfect matchings of plane bipartite graphs.

Discrete Mathematics, 2004

Z-transformation graphs of maximum matchings of plane bipartite graphs.

Discrete Applied Mathematics, 2004

Correcting the loss of cell-cycle synchrony in clustering analysis of microarray data using weights.

Bioinformatics, 2004

The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path.

Appl. Math. Lett., 2004

2003

A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph.

Order, 2003

Cell rotation graphs of strongly connected orientations of plane graphs with an application.

Discrete Applied Mathematics, 2003

2000

Total Z-transformation graphs of perfect matching of plane bipartite graphs.

Electronic Notes in Discrete Mathematics, 2000

The Clar covering polynomial of hexagonal systems III.

Discrete Mathematics, 2000

Plane elementary bipartite graphs.

Discrete Applied Mathematics, 2000

1999

Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs.

Ars Comb., 1999

1997

Perfect Matchings of Polyomino Graphs.

Graphs and Combinatorics, 1997

The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials.

Discrete Mathematics, 1997

A Note on the Number of Perfect Matchings of Bipartite Graphs.

Discrete Applied Mathematics, 1997

The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs.

Discrete Applied Mathematics, 1997

1996

The connectivity of Z-transformation graphs of perfect matchings of polyominoes.

Discrete Mathematics, 1996

A solution to Gutman's problem on the characteristic polynomial of a bipartite graph.

Discrete Mathematics, 1996

The Clar Covering Polynomial of Hexagonal Systems I.

Discrete Applied Mathematics, 1996

1993

Hexagonal Systems with Fixed Bonds.

Discrete Applied Mathematics, 1993