Hongping Ma

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

15 citations · 25 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

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 $E (G)$ of a graph $G$ is defined as the sum of the absolute values of its eigenvalues. Let $S_{2}$ be the star of order 2 (or $K_{2}$ ) and $Q$ be the graph obtained from $S_…

math.CO2009

A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ \leq 3$

Xueliang Li, Hongping Ma

The energy $E (G)$ of a graph $G$ is defined as the sum of the absolute values of its eigenvalues. A graph $G$ of order $n$ is said to be hypoenergetic if $E (G) < n$ . Majstorović et a…

math.CO2009★ 10 cited

Hypoenergetic and strongly hypoenergetic trees

Xueliang Li, Hongping Ma

The energy $E (G)$ of a graph $G$ is defined as the sum of the absolute values of the eigenvalues of $G$ . An $n$ -vertex graph is said to be hypoenergetic if $E (G) < n$ and strongly hy…

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

A proof of the conjecture on hypoenergetic graphs with maximum degree Δ≤3

Hypoenergetic and strongly hypoenergetic trees

A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ \leq 3$