most citedAll Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices

15 citations · 26 across the 6 of their papers we have counts for

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2014★ 1 cited

On the minimal energy of tetracyclic graphs

Hongping Ma, Yongqiang Bai

The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper, we characterize the tetracyclic graph of order wit…

math.CO2014

On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3

Hongping Ma, Yongqiang Bai, Shengjin Ji

The energy of a graph , denoted by , is defined as the sum of the absolute values of all eigenvalues of . Let be an even number and be the set of a…

math.CO2014

The matching energy of graphs with given edge connectivity

Shengjin Ji, Hongping Ma

Let G be a simple graph of order and the roots of its matching polynomial. The matching energy of is defined as the sum . Let $K_{n-…

math.CO2009★ 15 cited

All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices

Xueliang Li, Hongping Ma

The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Let be the star of order 2 (or ) and be the graph obtained from $S_…

math.CO2009

A proof of the conjecture on hypoenergetic graphs with maximum degree

Xueliang Li, Hongping Ma

The energy of a graph is defined as the sum of the absolute values of its eigenvalues. A graph of order is said to be hypoenergetic if . Majstorović et a…

math.CO2009★ 10 cited

Hypoenergetic and strongly hypoenergetic trees

Xueliang Li, Hongping Ma

The energy of a graph is defined as the sum of the absolute values of the eigenvalues of . An -vertex graph is said to be hypoenergetic if and strongly hy…