Heping Zhang

Orcid: 0000-0001-5385-6687

According to our database1, Heping Zhang authored at least 171 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Minimum degree of minimal (<i>n</i>-10)-factor-critical graphs.
Discret. Math., April, 2024

Integer k-matching preclusion of some interconnection networks.
Theor. Comput. Sci., 2024

Efficient multi-scale object detection model with space-to-depth convolution and BiFPN combined with FasterNet: a high-performance model for precise steel surface defect detection.
J. Electronic Imaging, 2024

On restricted matching extension of 1-embeddable graphs in surfaces with small genus.
Discret. Math., 2024

Complete forcing numbers of (4,6)-fullerenes.
Discret. Appl. Math., 2024

Cubic vertices of minimal bicritical graphs.
Discret. Appl. Math., 2024

Removable and forced subgraphs of graphs.
Discret. Appl. Math., 2024

The polyomino graphs whose resonance graphs have a 1-degree vertex.
Appl. Math. Comput., 2024

2023
The Path-Structure Connectivity of Augmented <i>k</i>-ary <i>n</i>-cubes.
Comput. J., December, 2023

The maximum matching extendability and factor-criticality of 1-planar graphs.
Discret. Appl. Math., October, 2023

Complete forcing numbers of complete and almost-complete multipartite graphs.
J. Comb. Optim., September, 2023

Structure connectivity of data center networks.
Appl. Math. Comput., August, 2023

Minimally k-Factor-Critical Graphs for Some Large k.
Graphs Comb., June, 2023

On anti-Kekulé and s-restricted matching preclusion problems.
J. Comb. Optim., May, 2023

Correction to: Star-structure connectivity of folded hypercubes and augmented cubes.
J. Supercomput., March, 2023

Star-structure connectivity of folded hypercubes and augmented cubes.
J. Supercomput., 2023

Some tight bounds on the minimum and maximum forcing numbers of graphs.
Discret. Appl. Math., 2023

A Consistent and Scalable Algorithm for Best Subset Selection in Single Index Models.
CoRR, 2023

Identification of Key Nodes in Complex Networks Based on Network Representation Learning.
IEEE Access, 2023

2022
Complete forcing numbers of graphs.
Ars Math. Contemp., November, 2022

The cycle-structure connectivity of crossed cubes.
Theor. Comput. Sci., 2022

Partial inverse maximum spanning tree problem under the Chebyshev norm.
J. Comb. Optim., 2022

Some novel minimax results for perfect matchings of hexagonal systems.
Discret. Appl. Math., 2022

Relations between global forcing number and maximum anti-forcing number of a graph.
Discret. Appl. Math., 2022

Best Subset Selection in Reduced Rank Regression.
CoRR, 2022

The Star-Structure Connectivity and Star-Substructure Connectivity of Hypercubes and Folded Hypercubes.
Comput. J., 2022

Super-taxon in human microbiome are identified to be associated with colorectal cancer.
BMC Bioinform., 2022

iProbiotics: a machine learning platform for rapid identification of probiotic properties from whole-genome primary sequences.
Briefings Bioinform., 2022

Continuous forcing spectrum of regular hexagonal polyhexes.
Appl. Math. Comput., 2022

The anti-forcing spectra of (4, 6)-fullerenes.
Appl. Math. Comput., 2022

2021
Surrogate Residuals for Discrete Choice Models.
J. Comput. Graph. Stat., 2021

Characterizing the fullerene graphs with the minimum forcing number 3.
Discret. Appl. Math., 2021

Graphs where each spanning tree has a perfect matching.
Contributions Discret. Math., 2021

Issues of Z-factor and an approach to avoid them for quality control in high-throughput screening studies.
Bioinform., 2021

Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l<sub>∞ </sub>-norm.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
J. Glob. Optim., 2020

Fractional matching preclusion number of graphs and the perfect matching polytope.
J. Comb. Optim., 2020

On the anti-Kekulé number of (4, 5, 6)-fullerenes.
Discret. Appl. Math., 2020

Matching preclusion for direct product of regular graphs.
Discret. Appl. Math., 2020

2019
Conditional Matching Preclusion for Folded Hypercubes.
J. Interconnect. Networks, 2019

The (n, k)-Extendable Graphs in Surfaces.
Graphs Comb., 2019

An accurate and powerful method for copy number variation detection.
Bioinform., 2019

Counting Clar structures of (4, 6)-fullerenes.
Appl. Math. Comput., 2019

2018
Construction for trees with unique minimum dominating sets.
Int. J. Comput. Math. Comput. Syst. Theory, 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.
Discuss. Math. Graph Theory, 2018

Anti-forcing polynomials for benzenoid systems with forcing edges.
Discret. Appl. Math., 2018

Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures.
Discret. Appl. Math., 2018

Hamiltonian laceability in hypercubes with faulty edges.
Discret. Appl. Math., 2018

Matching preclusion for n-grid graphs.
Discret. Appl. Math., 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

Application of Artificial Fish Swarm Algorithm in Vehicle Routing Problem.
Proceedings of the Bio-inspired Computing: Theories and Applications, 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.
Discret. Math. Theor. Comput. Sci., 2017

Per-spectral characterizations of some bipartite graphs.
Discuss. Math. Graph Theory, 2017

A negative answer to a problem on generalized Fibonacci cubes.
Discret. Math., 2017

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

Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs.
Discret. Appl. Math., 2017

Single coronoid systems with an anti-forcing edge.
Discret. Appl. Math., 2017

Extremal anti-forcing numbers of perfect matchings of graphs.
Discret. Appl. Math., 2017

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

modSaRa: a computationally efficient R package for CNV identification.
Bioinform., 2017

2016
3-Factor-Criticality of Vertex-Transitive Graphs.
J. Graph Theory, 2016

Complete forcing numbers of primitive coronoids.
J. Comb. Optim., 2016

Maximally matched and super matched regular graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2016

The restricted edge-connectivity and restricted connectivity of augmented <i>k</i>-ary <i>n</i>-cubes.
Int. J. Comput. Math., 2016

Small Matchings Extend to Hamiltonian Cycles in Hypercubes.
Graphs Comb., 2016

Proofs of two conjectures on generalized Fibonacci cubes.
Eur. J. Comb., 2016

A maximum resonant set of polyomino graphs.
Discuss. Math. Graph Theory, 2016

Extremal matching energy of complements of trees.
Discuss. Math. Graph Theory, 2016

The bondage number of the strong product of a complete graph with a path and a special starlike tree.
Discret. Math. Algorithms Appl., 2016

A minimax result for perfect matchings of a polyomino graph.
Discret. Appl. Math., 2016

Per-spectral and adjacency spectral characterizations of a complete graph removing six edges.
Discret. Appl. Math., 2016

Matching preclusion for vertex-transitive networks.
Discret. Appl. Math., 2016

Anti-forcing numbers of perfect matchings of graphs.
Discret. Appl. Math., 2016

Fullerenes with the maximum Clar number.
Discret. Appl. Math., 2016

4-Factor-Criticality of Vertex-Transitive Graphs.
Electron. J. Comb., 2016

Forcing polynomials of benzenoid parallelogram and its related benzenoids.
Appl. Math. Comput., 2016

Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial.
Appl. Math. Comput., 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.
Discret. Math., 2015

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

Modified screening and ranking algorithm for copy number variation detection.
Bioinform., 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.
Australas. J Comb., 2015

2014
Hyper-Hamiltonian laceability of balanced hypercubes.
J. Supercomput., 2014

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

A note on the permanental roots of bipartite graphs.
Discuss. Math. Graph Theory, 2014

Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges.
Discret. Math., 2014

Decomposition theorem on matchable distributive lattices.
Discret. Appl. Math., 2014

On the global forcing number of hexagonal systems.
Discret. Appl. Math., 2014

Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces.
Electron. 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

<i>l</i><sub>1</sub>l1-embeddability under the edge-gluing operation on graphs.
Discret. Math., 2013

Super restricted edge-connectivity of graphs with diameter 2.
Discret. Appl. Math., 2013

Fibonacci (p, r)-cubes which are median graphs.
Discret. Appl. Math., 2013

Matching extension in quadrangulations of the torus.
Australas. J Comb., 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.
Discret. Math., 2012

Computing the permanental polynomials of bipartite graphs by Pfaffian orientation.
Discret. Appl. Math., 2012

On the restricted matching extension of graphs in surfaces.
Appl. Math. Lett., 2012

2011
The use of classification trees for bioinformatics.
WIREs Data Mining 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.
Discret. Math., 2011

2-extendability and k-resonance of non-bipartite Klein-bottle polyhexes.
Discret. Appl. Math., 2011

On forcing matching number of boron-nitrogen fullerene graphs.
Discret. Appl. Math., 2011

l<sub>1</sub>-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.
Discret. Math., 2010

Maximally resonant polygonal systems.
Discret. Math., 2010

Forcing matching numbers of fullerene graphs.
Discret. Appl. Math., 2010

2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes.
Discret. Appl. Math., 2010

Embeddability of open-ended carbon nanotubes in hypercubes.
Comput. Geom., 2010

Maximal conditional chi-square importance in random forests.
Bioinform., 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. Discret. Math., 2009

Minimal 2-matching-covered graphs.
Discret. Math., 2009

Characterizations for P>=2-factor and P>=3-factor covered graphs.
Discret. Math., 2009

Fibonacci-like cubes as Z-transformation graphs.
Discret. Math., 2009

Degree conditions for graphs to be lambda<sub>3</sub>-optimal and super-lambda<sub>3</sub>.
Discret. Math., 2009

Kirchhoff index of composite graphs.
Discret. Appl. Math., 2009

Extremal fullerene graphs with the maximum Clar number.
Discret. Appl. Math., 2009

2-extendability of toroidal polyhexes and Klein-bottle polyhexes.
Discret. Appl. Math., 2009

Willows: a memory efficient tree and forest construction package.
BMC Bioinform., 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. Discret. Math., 2008

The Hosoya polynomial decomposition for hexagonal chains.
Math. Comput. Model., 2008

Path-comprehensive and vertex-pancyclic properties of super line graph <i>I</i>.
Discret. Math., 2008

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

None of the coronoid systems can be isometrically embedded into a hypercube.
Discret. Appl. Math., 2008

The Hosoya polynomial decomposition for catacondensed benzenoid graphs.
Discret. Appl. Math., 2008

Hosoya polynomials under gated amalgamations.
Discret. Appl. Math., 2008

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

2007
Sufficient conditions for graphs to be <i>lambda'</i>-optimal and super-<i>lambda'</i>.
Networks, 2007

A characterization of the interval distance monotone graphs.
Discret. Math., 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 <i>k</i>-extendable bipartite graphs.
Discret. Math., 2006

2005
Case Report: A High Productivity/Low Maintenance Approach to High-performance Computation for Biomedicine: Four Case Studies.
J. Am. Medical Informatics Assoc., 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
<i>Z</i>-transformation graphs of perfect matchings of plane bipartite graphs.
Discret. Math., 2004

Z-transformation graphs of maximum matchings of plane bipartite graphs.
Discret. Appl. Math., 2004

Correcting the loss of cell-cycle synchrony in clustering analysis of microarray data using weights.
Bioinform., 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.
Discret. Appl. Math., 2003

2000
Total Z-transformation graphs of perfect matching of plane bipartite graphs.
Electron. Notes Discret. Math., 2000

The Clar covering polynomial of hexagonal systems III.
Discret. Math., 2000

Plane elementary bipartite graphs.
Discret. Appl. Math., 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 Comb., 1997

The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials.
Discret. Math., 1997

A Note on the Number of Perfect Matchings of Bipartite Graphs.
Discret. Appl. Math., 1997

The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs.
Discret. Appl. Math., 1997

1996
The connectivity of Z-transformation graphs of perfect matchings of polyominoes.
Discret. Math., 1996

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

The Clar Covering Polynomial of Hexagonal Systems I.
Discret. Appl. Math., 1996

1993
Hexagonal Systems with Fixed Bonds.
Discret. Appl. Math., 1993


  Loading...