H
Heping Zhang
Researcher at Lanzhou University
Publications - 251
Citations - 5692
Heping Zhang is an academic researcher from Lanzhou University. The author has contributed to research in topics: Bipartite graph & Cubic graph. The author has an hindex of 31, co-authored 227 publications receiving 5035 citations. Previous affiliations of Heping Zhang include Commonwealth Scientific and Industrial Research Organisation & University of Reading.
Papers
More filters
Journal ArticleDOI
Bondage number of strong product of two paths
Weisheng Zhao,Heping Zhang +1 more
TL;DR: In this paper, the exact value of the bondage number of the strong product of two paths was obtained for any two positive integers m and n, where m is a function of positive integer t, defined as r(t) = 1 if t ≡ 1 (mod 3).
Journal ArticleDOI
Degree conditions for graphs to be λ3-optimal and super-λ3
Li Shang,Heping Zhang +1 more
TL;DR: For a positive integer m, an edge-cut S of a connected graph G is an m-restricted edge cut if each component of G-S contains at least m vertices as mentioned in this paper.
Journal ArticleDOI
On the anti-Kekulé number of (4,5,6)-fullerenes
Lifang Zhao,Heping Zhang +1 more
TL;DR: It is shown that the anti-Kekule number of a 2-connected cubic graph is either 3 or 4, and there is a (4,5,6)-fullerene with n vertices having theAnti-Keksule number 3 for any even n ⩾ 10 .
Journal ArticleDOI
Matching preclusion for n-grid graphs
Qi Ding,Heping Zhang,Hui Zhou +2 more
TL;DR: The matching preclusion problems for n -grid graphs are studied and all the optimal matchingPreclusion sets are characterized.
Journal ArticleDOI
Counting Clar structures of (4, 6)-fullerenes
TL;DR: A (4, 6)-fullerene graph G is a plane cubic graph whose faces are squares and hexagons and a formula to count maximum sextet patterns of G only depending on the order of G and the number of fixed subgraphs J1 of G, where the count equals the coefficient of the term with largest degree in its sextets polynomial.