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

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

2009-06-15

arxiv.org/abs/0906.2604v2

Mathematics

Combinatorics

10 pages

Scientific paper

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)

Affiliated with

Also associated with

No associations

Rating

A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of the conjecture on hypoenergetic graphs with maximum degree $Δ\leq 3$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315569