activity
20082026
most citedExtremal fullerene graphs with the maximum Clar number

35 citations · 156 across the 42 of their papers we have counts for

collaborators
Showing 2014 · math.COShow all

7 papers · 2 filters

math.CO2014★ 1 cited

Extremal matching energy of complements of trees

Tingzeng Wu, Weigen Yan, Heping Zhang

The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching ener…

math.CO2014

A Maximum Resonant Set of Polyomino Graphs

Heping Zhang, Xiangqian Zhou

A polyomino graph is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belong…

math.CO2014

Continuous anti-forcing spectra of cata-condensed hexagonal systems

Kai Deng, Heping Zhang

The anti-forcing number of a perfect matching of a graph is the minimal number of edges not in whose removal make as a unique perfect matching of the resulting grap…

math.CO2014

Fullerenes with the maximum Clar number

Yang Gao, Qiuli Li, Heping Zhang

The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded a…

math.CO2014

4-Factor-criticality of vertex-transitive graphs

Wuyang Sun, Heping Zhang

A graph of order is -factor-critical, where is an integer of the same parity as , if the removal of any set of vertices results in a graph with a perfect matching…

math.CO2014

Permanental polynomials of skew adjacency matrices of oriented graphs

Shunyi Liu, Heping Zhang

Let be an orientation of a simple graph . In this paper, the permanental polynomial of an oriented graph is introduced. The coefficients of the permanental polynomia…