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

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

2009-07-08

arxiv.org/abs/0907.1341v1

Mathematics

Combinatorics

17 pages

Scientific paper

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_2$ by attaching two pendent edges to each of the end vertices of $S_2$. Majstorovi\'c et al. conjectured that $S_2$, $Q$ and the complete bipartite graphs $K_{2,2}$ and $K_{3,3}$ are the only 4 connected graphs with maximum degree $\Delta \leq 3$ whose energies are equal to the number of vertices. This paper is devoted to giving a confirmative proof to the conjecture.

Affiliated with

Also associated with

No associations

Rating

All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices 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 All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319875