default search action
Heping Zhang
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j164]Chunhu Sun, Yaxian Zhang
, Heping Zhang
The polyomino graphs whose resonance graphs have a 1-degree vertex. Appl. Math. Comput. 474: 128704 (2024) - [j163]Wuxian Chen, Heping Zhang
Removable and forced subgraphs of graphs. Discret. Appl. Math. 351: 23-35 (2024) - [j162]Jing Guo, Hailun Wu, Heping Zhang:
Cubic vertices of minimal bicritical graphs. Discret. Appl. Math. 352: 44-48 (2024) - [j161]Xin He
Complete forcing numbers of (4,6)-fullerenes. Discret. Appl. Math. 357: 385-398 (2024) - [j160]Jing Guo, Heping Zhang
Minimum degree of minimal (n-10)-factor-critical graphs. Discret. Math. 347(4): 113839 (2024) - [j159]Jiangyue Zhang, Yan Wu
On restricted matching extension of 1-embeddable graphs in surfaces with small genus. Discret. Math. 347(12): 114172 (2024) - [j158]Jun Su, Heping Zhang, Krzysztof Przystupa, Orest Kochan:
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 33(3) (2024) - [j157]Hailun Wu, Lina Ba, Heping Zhang
Integer k-matching preclusion of some interconnection networks. Theor. Comput. Sci. 992: 114449 (2024) - 2023
- [j156]Heping Zhang
Identification of Key Nodes in Complex Networks Based on Network Representation Learning. IEEE Access 11: 128175-128186 (2023) - [j155]Lina Ba, Heping Zhang
Structure connectivity of data center networks. Appl. Math. Comput. 451: 128022 (2023) - [j154]Lina Ba
The Path-Structure Connectivity of Augmented k-ary n-cubes. Comput. J. 66(12): 3119-3128 (2023) - [j153]Qianqian Liu
Some tight bounds on the minimum and maximum forcing numbers of graphs. Discret. Appl. Math. 324: 126-135 (2023) - [j152]Jiangyue Zhang, Yan Wu
The maximum matching extendability and factor-criticality of 1-planar graphs. Discret. Appl. Math. 338: 247-254 (2023) - [j151]Jing Guo, Heping Zhang
Minimally k-Factor-Critical Graphs for Some Large k. Graphs Comb. 39(3): 60 (2023) - [j150]Huazhong Lü
On anti-Kekulé and s-restricted matching preclusion problems. J. Comb. Optim. 45(4): 103 (2023) - [j149]Xin He, Heping Zhang
Complete forcing numbers of complete and almost-complete multipartite graphs. J. Comb. Optim. 46(2): 11 (2023) - [j148]Lina Ba
Star-structure connectivity of folded hypercubes and augmented cubes. J. Supercomput. 79(3): 3257-3276 (2023) - [j147]Lina Ba
Correction to: Star-structure connectivity of folded hypercubes and augmented cubes. J. Supercomput. 79(5): 5828 (2023) - [i5]Borui Tang, Jin Zhu, Junxian Zhu, Xueqin Wang, Heping Zhang:
A Consistent and Scalable Algorithm for Best Subset Selection in Single Index Models. CoRR abs/2309.06230 (2023) - 2022
- [j146]Yaxian Zhang
Continuous forcing spectrum of regular hexagonal polyhexes. Appl. Math. Comput. 425: 127058 (2022) - [j145]Lingjuan Shi
The anti-forcing spectra of (4, 6)-fullerenes. Appl. Math. Comput. 425: 127090 (2022) - [j144]Xin He, Heping Zhang:
Complete forcing numbers of graphs. Ars Math. Contemp. 23(2) (2022) - [j143]Yu Sun, Haicheng Li, Lei Zheng, Jinzhao Li, Yan Hong, Pengfei Liang, Lai-Yu Kwok, Yongchun Zuo
iProbiotics: a machine learning platform for rapid identification of probiotic properties from whole-genome primary sequences. Briefings Bioinform. 23(1) (2022) - [j142]Wei Dai, Cai Li, Ting Li, Jianchang Hu, Heping Zhang
Super-taxon in human microbiome are identified to be associated with colorectal cancer. BMC Bioinform. 23(1): 243 (2022) - [j141]Lina Ba, Heping Zhang
The Star-Structure Connectivity and Star-Substructure Connectivity of Hypercubes and Folded Hypercubes. Comput. J. 65(12): 3156-3166 (2022) - [j140]Yaxian Zhang
Relations between global forcing number and maximum anti-forcing number of a graph. Discret. Appl. Math. 311: 85-96 (2022) - [j139]Xiangqian Zhou, Heping Zhang
Some novel minimax results for perfect matchings of hexagonal systems. Discret. Appl. Math. 320: 435-445 (2022) - [j138]Xianyue Li
Partial inverse maximum spanning tree problem under the Chebyshev norm. J. Comb. Optim. 44(5): 3331-3350 (2022) - [j137]Lina Ba, Heping Zhang:
The cycle-structure connectivity of crossed cubes. Theor. Comput. Sci. 922: 335-345 (2022) - [i4]Canhong Wen, Ruipeng Dong
Best Subset Selection in Reduced Rank Regression. CoRR abs/2211.15889 (2022) - 2021
- [j136]Xiaohua Douglas Zhang
Issues of Z-factor and an approach to avoid them for quality control in high-throughput screening studies. Bioinform. 36(22-23): 5299-5303 (2021) - [j135]Baoyindureng Wu, Heping Zhang:
Graphs where each spanning tree has a perfect matching. Contributions Discret. Math. 16(3): 1-8 (2021) - [j134]Lingjuan Shi, Heping Zhang
Characterizing the fullerene graphs with the minimum forcing number 3. Discret. Appl. Math. 294: 181-204 (2021) - [j133]Chao Cheng, Rui Wang, Heping Zhang
Surrogate Residuals for Discrete Choice Models. J. Comput. Graph. Stat. 30(1): 67-77 (2021) - [c3]Xianyue Li
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. COCOA 2021: 389-399 - 2020
- [j132]Ruizhi Lin
Matching preclusion for direct product of regular graphs. Discret. Appl. Math. 277: 221-230 (2020) - [j131]Lifang Zhao, Heping Zhang
On the anti-Kekulé number of (4, 5, 6)-fullerenes. Discret. Appl. Math. 283: 577-589 (2020) - [j130]Ruizhi Lin
Fractional matching preclusion number of graphs and the perfect matching polytope. J. Comb. Optim. 39(3): 915-932 (2020) - [j129]Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2): 319-340 (2020) - [i3]Lina Ba, Heping Zhang:
The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes. CoRR abs/2009.13751 (2020)
2010 – 2019
- 2019
- [j128]Lingjuan Shi, Heping Zhang
Counting Clar structures of (4, 6)-fullerenes. Appl. Math. Comput. 346: 559-574 (2019) - [j127]Feifei Xiao, Xizhi Luo, Ning Hao, Yue Niu, Xiangjun Xiao, Guoshuai Cai, Christopher I. Amos, Heping Zhang
An accurate and powerful method for copy number variation detection. Bioinform. 35(17): 2891-2898 (2019) - [j126]Yushan Ma, Qiuli Li, Heping Zhang
The (n, k)-Extendable Graphs in Surfaces. Graphs Comb. 35(4): 941-957 (2019) - [j125]Ruizhi Lin
Conditional Matching Preclusion for Folded Hypercubes. J. Interconnect. Networks 19(3): 1940011:1-1940011:16 (2019) - 2018
- [j124]Weisheng Zhao, Xiaolu Gao, Heping Zhang:
Construction for Trees without vertices contained in all minimum dominating sets. Ars Comb. 138: 3-16 (2018) - [j123]Hao Li, Heping Zhang:
The isolated-pentagon rule and nice substructures in fullerenes. Ars Math. Contemp. 15(2): 487-497 (2018) - [j122]Fan Wang, Heping Zhang
Hamiltonian laceability in hypercubes with faulty edges. Discret. Appl. Math. 236: 438-445 (2018) - [j121]Yi Zhang, Heping Zhang
Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures. Discret. Appl. Math. 238: 144-157 (2018) - [j120]Qi Ding, Heping Zhang
Matching preclusion for n-grid graphs. Discret. Appl. Math. 243: 194-206 (2018) - [j119]Shuang Zhao, Heping Zhang
Anti-forcing polynomials for benzenoid systems with forcing edges. Discret. Appl. Math. 250: 342-356 (2018) - [j118]Yang Gao, Heping Zhang
Sharp upper bounds on the Clar number of fullerene graphs. Discuss. Math. Graph Theory 38(1): 155-163 (2018) - [j117]Weisheng Zhao, Heping Zhang
Upper bounds on the bondage number of the strong product of a graph and a tree. Int. J. Comput. Math. 95(3): 511-527 (2018) - [j116]Weisheng Zhao, Fan Wang, Heping Zhang
Construction for trees with unique minimum dominating sets. Int. J. Comput. Math. Comput. Syst. Theory 3(3): 204-213 (2018) - [c2]Shiyu Jia, Kang Zhou, Yu Yang, Huaqing Qi, Yiting Zhen, Long Hu, Zhou Zhang, Heping Zhang:
Application of Artificial Fish Swarm Algorithm in Vehicle Routing Problem. BIC-TA (2) 2018: 1-12 - 2017
- [j115]Feifei Xiao, Yue Niu, Ning Hao, Yanxun Xu, Zhilin Jin
modSaRa: a computationally efficient R package for CNV identification. Bioinform. 33(15): 2384-2385 (2017) - [j114]Kai Deng, Heping Zhang
Extremal anti-forcing numbers of perfect matchings of graphs. Discret. Appl. Math. 224: 69-79 (2017) - [j113]Xiaodong Liang, Heping Zhang
Single coronoid systems with an anti-forcing edge. Discret. Appl. Math. 233: 94-103 (2017) - [j112]Ruizhi Lin
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs. Discret. Appl. Math. 233: 104-117 (2017) - [j111]Lingjuan Shi, Hongwei Wang, Heping Zhang
On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes. Discret. Appl. Math. 233: 187-194 (2017) - [j110]Jianxin Wei
A negative answer to a problem on generalized Fibonacci cubes. Discret. Math. 340(2): 81-86 (2017) - [j109]Tingzeng Wu, Heping Zhang
Per-spectral characterizations of some bipartite graphs. Discuss. Math. Graph Theory 37(4): 935-951 (2017) - [j108]Lingjuan Shi, Heping Zhang
Tight upper bound on the maximum anti-forcing numbers of graphs. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j107]Kai Deng, Heping Zhang
Anti-forcing spectra of perfect matchings of graphs. J. Comb. Optim. 33(2): 660-680 (2017) - [i2]Huazhong Lü, Xianyue Li, Heping Zhang:
NP-completeness of anti-Kekulé and matching preclusion problems. CoRR abs/1706.09321 (2017) - 2016
- [j106]Shuang Zhao, Heping Zhang
Forcing polynomials of benzenoid parallelogram and its related benzenoids. Appl. Math. Comput. 284: 209-218 (2016) - [j105]Wei Li, Zhongmei Qin, Heping Zhang
Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial. Appl. Math. Comput. 291: 30-38 (2016) - [j104]Wuyang Sun, Heping Zhang:
4-Factor-Criticality of Vertex-Transitive Graphs. Electron. J. Comb. 23(3): 3 (2016) - [j103]Yang Gao, Qiuli Li, Heping Zhang
Fullerenes with the maximum Clar number. Discret. Appl. Math. 202: 58-69 (2016) - [j102]Hongchuan Lei, Yeong-Nan Yeh, Heping Zhang
Anti-forcing numbers of perfect matchings of graphs. Discret. Appl. Math. 202: 95-105 (2016) - [j101]Tingzeng Wu, Heping Zhang
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges. Discret. Appl. Math. 203: 158-170 (2016) - [j100]Xiangqian Zhou, Heping Zhang
A minimax result for perfect matchings of a polyomino graph. Discret. Appl. Math. 206: 165-171 (2016) - [j99]Qiuli Li, Jinghua He, Heping Zhang
Matching preclusion for vertex-transitive networks. Discret. Appl. Math. 207: 90-98 (2016) - [j98]Weisheng Zhao, Heping Zhang
The bondage number of the strong product of a complete graph with a path and a special starlike tree. Discret. Math. Algorithms Appl. 8(1): 1650006:1-1650006:14 (2016) - [j97]Heping Zhang
A maximum resonant set of polyomino graphs. Discuss. Math. Graph Theory 36(2): 323-337 (2016) - [j96]Tingzeng Wu
Extremal matching energy of complements of trees. Discuss. Math. Graph Theory 36(3): 505-521 (2016) - [j95]Jianxin Wei
Proofs of two conjectures on generalized Fibonacci cubes. Eur. J. Comb. 51: 419-432 (2016) - [j94]Fan Wang, Heping Zhang
Small Matchings Extend to Hamiltonian Cycles in Hypercubes. Graphs Comb. 32(1): 363-376 (2016) - [j93]Ruizhi Lin
The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes. Int. J. Comput. Math. 93(8): 1281-1298 (2016) - [j92]Ruizhi Lin
Maximally matched and super matched regular graphs. Int. J. Comput. Math. Comput. Syst. Theory 1(2): 74-84 (2016) - [j91]Shou-Jun Xu, Xiu-Song Liu, Wai Hong Chan, Heping Zhang
Complete forcing numbers of primitive coronoids. J. Comb. Optim. 32(1): 318-330 (2016) - [j90]Heping Zhang
3-Factor-Criticality of Vertex-Transitive Graphs. J. Graph Theory 81(3): 262-271 (2016) - 2015
- [j89]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Dong Ye, Heping Zhang:
Matching extension in toroidal quadrangulations II: the 3-extendable case. Australas. J Comb. 63: 268-296 (2015) - [j88]Fan Wang, Heping Zhang:
Two types of matchings extend to Hamiltonian cycles in hypercubes. Ars Comb. 118: 269-283 (2015) - [j87]Tingzeng Wu, Heping Zhang:
Some analytical properties of the permanental polynomial of a graph. Ars Comb. 123: 261-267 (2015) - [j86]Feifei Xiao, Xiaoyi Min, Heping Zhang
Modified screening and ranking algorithm for copy number variation detection. Bioinform. 31(9): 1341-1348 (2015) - [j85]Haiyuan Yao
Non-matchable distributive lattices. Discret. Math. 338(3): 122-132 (2015) - [j84]Rui Yang, Heping Zhang
2-resonant fullerenes. Eur. J. Comb. 49: 13-24 (2015) - [j83]Fan Wang, Heping Zhang
Matchings extend to Hamiltonian cycles in k-ary n-cubes. Inf. Sci. 305: 1-13 (2015) - [j82]Shou-Jun Xu, Heping Zhang
Complete forcing numbers of catacondensed hexagonal systems. J. Comb. Optim. 29(4): 803-814 (2015) - [j81]Jianxin Wei
Solution to a conjecture on words that are bad and 2-isometric. Theor. Comput. Sci. 562: 243-251 (2015) - [i1]Sean Skwerer, Heping Zhang:
Computing Affine Combinations, Distances, and Correlations for Recursive Partition Functions. CoRR abs/1512.03697 (2015) - 2014
- [j80]Jianxin Wei, Heping Zhang:
Fibonacci (p, r)-cubes which are partial cubes. Ars Comb. 115: 197-209 (2014) - [j79]Qiuli Li, Heping Zhang:
5-factor-critical graphs on the torus. Ars Comb. 115: 357-366 (2014) - [j78]Dong Ye, Heping Zhang:
Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces. Electron. J. Comb. 21(4): 4 (2014) - [j77]Heping Zhang
On the global forcing number of hexagonal systems. Discret. Appl. Math. 162: 334-347 (2014) - [j76]Heping Zhang
Decomposition theorem on matchable distributive lattices. Discret. Appl. Math. 166: 239-248 (2014) - [j75]Fan Wang
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges. Discret. Math. 321: 35-44 (2014) - [j74]Wei Li, Shunyi Liu
A note on the permanental roots of bipartite graphs. Discuss. Math. Graph Theory 34(1): 49-56 (2014) - [j73]Yang Gao
Clar Structure and Fries Set of Fullerenes and (4, 6)-Fullerenes on Surfaces. J. Appl. Math. 2014: 196792:1-196792:11 (2014) - [j72]Huazhong Lü
Hyper-Hamiltonian laceability of balanced hypercubes. J. Supercomput. 68(1): 302-314 (2014) - 2013
- [j71]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Heping Zhang:
Matching extension in quadrangulations of the torus. Australas. J Comb. 57: 217-234 (2013) - [j70]Lifeng Ou, Heping Zhang
Fibonacci (p, r)-cubes which are median graphs. Discret. Appl. Math. 161(3): 441-444 (2013) - [j69]Li Shang, Heping Zhang
Super restricted edge-connectivity of graphs with diameter 2. Discret. Appl. Math. 161(3): 445-451 (2013) - [j68]Guangfu Wang, Heping Zhang
l1l1-embeddability under the edge-gluing operation on graphs. Discret. Math. 313(20): 2115-2118 (2013) - [j67]R. Todd Constable
A left cerebellar pathway mediates language in prematurely-born young adults. NeuroImage 64: 371-378 (2013) - 2012
- [j66]Qiuli Li, Heping Zhang
On the restricted matching extension of graphs in surfaces. Appl. Math. Lett. 25(11): 1750-1754 (2012) - [j65]Heping Zhang
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation. Discret. Appl. Math. 160(13-14): 2069-2074 (2012) - [j64]Qiuli Li, Heping Zhang
On the restricted matching extension of graphs on the torus and the Klein bottle. Discret. Math. 312(16): 2450-2456 (2012) - [j63]Rong Yang, Zhao-Lan Yang, Heping Zhang
Some Indices of Alphabet Overlap Graph. J. Comput. Sci. Technol. 27(4): 897-902 (2012) - [j62]Huazhong Lü
Matching preclusion for balanced hypercubes. Theor. Comput. Sci. 465: 10-20 (2012) - 2011
- [j61]Ling Wang, Heping Zhang:
On Diameter Stability of the Johnson Graph. Ars Comb. 100: 327-335 (2011) - [j60]Guangfu Wang, Heping Zhang:
l1-Embeddability of Hexagonal and Quadrilateral Mobius graphs. Ars Comb. 102: 269-287 (2011) - [j59]Qiuli Li, Saihua Liu, Heping Zhang
2-extendability and k-resonance of non-bipartite Klein-bottle polyhexes. Discret. Appl. Math. 159(8): 800-811 (2011) - [j58]Xiaoyan Jiang, Heping Zhang
On forcing matching number of boron-nitrogen fullerene graphs. Discret. Appl. Math. 159(15): 1581-1593 (2011) - [j57]Lifeng Ou, Heping Zhang
Determining which Fibonacci (p, r)-cubes can be Z-transformation graphs. Discret. Math. 311(16): 1681-1692 (2011) - [j56]Martha Skup, Hongtu Zhu, Yaping Wang, Kelly S. Giovanello, Ja-an Lin, Dinggang Shen, Feng Shi
Sex differences in grey matter atrophy patterns among AD and aMCI patients: Results from ADNI. NeuroImage 56(3): 890-906 (2011) - [j55]Xiang Chen
The use of classification trees for bioinformatics. WIREs Data Mining Knowl. Discov. 1(1): 55-63 (2011) - 2010
- [j54]Wantao Ning, Qiuli Li, Heping Zhang:
Smallest generalized cuts and diameter-increasing sets of Johnson graphs. Ars Comb. 95 (2010) - [j53]Heping Zhang, Shan Zhou:
A note on path factors in claw-free graphs. Ars Comb. 97 (2010) - [j52]Minghui Wang, Xiang Chen
Maximal conditional chi-square importance in random forests. Bioinform. 26(6): 831-837 (2010) - [j51]Heping Zhang, Guangfu Wang:
Embeddability of open-ended carbon nanotubes in hypercubes. Comput. Geom. 43(5): 524-534 (2010) - [j50]Heping Zhang
Forcing matching numbers of fullerene graphs. Discret. Appl. Math. 158(5): 573-582 (2010) - [j49]Heping Zhang
2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes. Discret. Appl. Math. 158(14): 1559-1569 (2010) - [j48]Saihua Liu, Heping Zhang
Maximally resonant polygonal systems. Discret. Math. 310(21): 2790-2800 (2010) - [j47]Xiaoling Zhang
Some results on Laplacian spectral radius of graphs with cut vertices. Discret. Math. 310(24): 3494-3505 (2010) - [j46]Heping Zhang
Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph. Order 27(2): 101-113 (2010)
2000 – 2009
- 2009
- [j45]Jingzhi Yan, Heping Zhang:
A Note on Path-Matchings. Ars Comb. 90 (2009) - [j44]Xiaoling Zhang, Heping Zhang:
The Laplacian spectral radius of unicyclic graphs with k pendent vertices. Ars Comb. 90 (2009) - [j43]Heping Zhang
Willows: a memory efficient tree and forest construction package. BMC Bioinform. 10 (2009) - [j42]Dong Ye
2-extendability of toroidal polyhexes and Klein-bottle polyhexes. Discret. Appl. Math. 157(2): 292-299 (2009) - [j41]Heping Zhang
Kirchhoff index of composite graphs. Discret. Appl. Math. 157(13): 2918-2927 (2009) - [j40]Dong Ye
Extremal fullerene graphs with the maximum Clar number. Discret. Appl. Math. 157(14): 3152-3173 (2009) - [j39]Heping Zhang
Fibonacci-like cubes as Z-transformation graphs. Discret. Math. 309(6): 1284-1293 (2009) - [j38]Heping Zhang
Characterizations for P>=2-factor and P>=3-factor covered graphs. Discret. Math. 309(8): 2067-2076 (2009) - [j37]Li Shang, Heping Zhang
Degree conditions for graphs to be lambda3-optimal and super-lambda3. Discret. Math. 309(10): 3336-3345 (2009) - [j36]Shan Zhou, Heping Zhang
Minimal 2-matching-covered graphs. Discret. Math. 309(13): 4270-4279 (2009) - [j35]Dong Ye
On k-Resonant Fullerene Graphs. SIAM J. Discret. Math. 23(2): 1023-1044 (2009) - 2008
- [j34]Meizhuo Zhang, Rui Feng, Xiang Chen
LOT: a tool for linkage analysis of ordinal traits for pedigree data. Bioinform. 24(15): 1737-1739 (2008) - [j33]Shan Zhou, Heping Zhang
Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system. Discret. Appl. Math. 156(10): 1809-1821 (2008) - [j32]Shoujun Xu, Heping Zhang
Hosoya polynomials under gated amalgamations. Discret. Appl. Math. 156(12): 2407-2419 (2008) - [j31]Heping Zhang
None of the coronoid systems can be isometrically embedded into a hypercube. Discret. Appl. Math. 156(14): 2817-2822 (2008) - [j30]Shoujun Xu, Heping Zhang
The Hosoya polynomial decomposition for catacondensed benzenoid graphs. Discret. Appl. Math. 156(15): 2930-2938 (2008) - [j29]Xia Li, Hao Li, Heping Zhang
Path-comprehensive and vertex-pancyclic properties of super line graph I. Discret. Math. 308(24): 6308-6315 (2008) - [j28]Shoujun Xu, Heping Zhang
The Hosoya polynomial decomposition for hexagonal chains. Math. Comput. Model. 48(3-4): 601-609 (2008) - [j27]Heping Zhang
Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems. SIAM J. Discret. Math. 22(3): 971-984 (2008) - [j26]Hao Li, Huifang Miao, Li Liu, Lian Li, Heping Zhang
Energy conservation in wireless sensor networks and connectivity of graphs. Theor. Comput. Sci. 393(1-3): 81-89 (2008) - 2007
- [j25]Heping Zhang
A min-max result on outerplane bipartite graphs. Appl. Math. Lett. 20(2): 199-205 (2007) - [j24]Jingrong Chen, Heping Zhang:
Resonance of Plane Bipartite Graphs. Ars Comb. 85 (2007) - [j23]Heping Zhang
A characterization of the interval distance monotone graphs. Discret. Math. 307(21): 2622-2627 (2007) - [j22]Li Shang, Heping Zhang
Sufficient conditions for graphs to be lambda'-optimal and super-lambda'. Networks 49(3): 234-242 (2007) - 2006
- [j21]Fuji Zhang, Heping Zhang
Construction for bicritical graphs and k-extendable bipartite graphs. Discret. Math. 306(13): 1415-1423 (2006) - 2005
- [j20]Jia Shen, Heping Zhang:
k-factor-covered Regular Graphs. Ars Comb. 75 (2005) - [j19]Nicholas Carriero, Michael V. Osier, Kei-Hoi Cheung, Perry L. Miller, Mark Gerstein, Hongyu Zhao
Case Report: A High Productivity/Low Maintenance Approach to High-performance Computation for Biomedicine: Four Case Studies. J. Am. Medical Informatics Assoc. 12(1): 90-98 (2005) - [c1]Heping Zhang:
Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs. CJCDGCGT 2005: 259-271 - 2004
- [j18]Heping Zhang, Lingbo Zhao, Haiyuan Yao
The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path. Appl. Math. Lett. 17(8): 897-901 (2004) - [j17]Fenghai Duan, Heping Zhang
Correcting the loss of cell-cycle synchrony in clustering analysis of microarray data using weights. Bioinform. 20(11): 1766-1771 (2004) - [j16]Heping Zhang
Z-transformation graphs of maximum matchings of plane bipartite graphs. Discret. Appl. Math. 134(1-3): 339-350 (2004) - [j15]Heping Zhang
Z-transformation graphs of perfect matchings of plane bipartite graphs. Discret. Math. 276(1-3): 393-404 (2004) - 2003
- [j14]Heping Zhang
Cell rotation graphs of strongly connected orientations of plane graphs with an application. Discret. Appl. Math. 130(3): 469-485 (2003) - [j13]Peter Che Bor Lam, Heping Zhang
A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph. Order 20(1): 13-29 (2003) - 2000
- [j12]Heping Zhang
Plane elementary bipartite graphs. Discret. Appl. Math. 105(1-3): 291-311 (2000) - [j11]Heping Zhang
The Clar covering polynomial of hexagonal systems III. Discret. Math. 212(3): 261-269 (2000) - [j10]Heping Zhang, Fuji Zhang:
Total Z-transformation graphs of perfect matching of plane bipartite graphs. Electron. Notes Discret. Math. 5: 317-320 (2000)
1990 – 1999
- 1999
- [j9]Heping Zhang, Fuji Zhang:
Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs. Ars Comb. 53 (1999) - 1997
- [j8]Heping Zhang
The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs. Discret. Appl. Math. 73(1): 5-12 (1997) - [j7]Fuji Zhang, Heping Zhang:
A Note on the Number of Perfect Matchings of Bipartite Graphs. Discret. Appl. Math. 73(3): 275-282 (1997) - [j6]Heping Zhang
The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials. Discret. Math. 172(1-3): 163-173 (1997) - [j5]Heping Zhang, Fuji Zhang:
Perfect Matchings of Polyomino Graphs. Graphs Comb. 13(3): 295-304 (1997) - 1996
- [j4]Heping Zhang
The Clar Covering Polynomial of Hexagonal Systems I. Discret. Appl. Math. 69(1-2): 147-167 (1996) - [j3]Xueliang Li, Heping Zhang
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. Discret. Math. 154(1-3): 297-300 (1996) - [j2]Heping Zhang
The connectivity of Z-transformation graphs of perfect matchings of polyominoes. Discret. Math. 158(1-3): 257-272 (1996) - 1993
- [j1]Fuji Zhang, Xueliang Li, Heping Zhang
Hexagonal Systems with Fixed Bonds. Discret. Appl. Math. 47(3): 285-296 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: