Article

# On bipartite graphs with minimal energy.

(Impact Factor: 0.68). 02/2009; 157:869-873. DOI: 10.1016/j.dam.2008.07.008
Source: DBLP

ABSTRACT The energy of a graph is the sum of the absolute values of the eigenvalues of the graph. In a paper [G. Caporossi, D. Cvetkovi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem. Inf. Comput. Sci. 39 (1999) 984–996] Caporossi et al. conjectured that among all connected graphs G with n≥6 vertices and n−1≤m≤2(n−2) edges, the graphs with minimum energy are the star Sn with m−n+1 additional edges all connected to the same vertices for m≤n+⌊(n−7)/2⌋, and the bipartite graph with two vertices on one side, one of which is connected to all vertices on the other side, otherwise. The conjecture is proved to be true for m=n−1,2(n−2) in the same paper by Caporossi et al. themselves, and for m=n by Hou in [Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001) 163–168]. In this paper, we give a complete solution for the second part of the conjecture on bipartite graphs. Moreover, we determine the graph with the second-minimal energy in all connected bipartite graphs with n vertices and m(n≤m≤2n−5) edges.

0 Bookmarks
·
91 Views
• Source
##### Article: On a conjecture about tricyclic graphs with maximal energy
[Hide abstract]
ABSTRACT: For a given simple graph $G$, the energy of $G$, denoted by $\mathcal {E}(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal energy tends to be complicated for a given class of graphs. There are many approaches on the maximal energy of trees, unicyclic graphs and bicyclic graphs, respectively. In this paper, we study the maximal energy of tricyclic graphs. Let $P^{6,6,6}_n$ denote the graph with $n\geq 20$ vertices obtained from three copies of $C_6$ and a path $P_{n-18}$ by adding a single edge between each of two copies of $C_6$ to one endpoint of the path and a single edge from the third $C_6$ to the other endpoint of the $P_{n-18}$. Very recently, Aouchiche et al. [M. Aouchiche, G. Caporossi, P. Hansen, Open problems on graph eigenvalues studied with AutoGraphiX, {\it EURO J. Comput. Optim.} {\bf 1}(2013), 181--199] put forward the following conjecture: let $G$ be a tricyclic graphs on $n$ vertices with $n=20$ or $n\geq22$, then $\mathcal{E}(G)\leq \mathcal{E}(P_{n}^{6,6,6})$ with equality if and only if $G\cong P_{n}^{6,6,6}$. We partially solve this conjecture.
MATCH Communications in Mathematical and in Computer Chemistry 08/2014; 72(1):183-214. · 1.83 Impact Factor
• Source
##### Article: On the minimal energy of tetracyclic graphs
[Hide abstract]
ABSTRACT: 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 $n$ with minimal energy. By this, the validity of a conjecture for the case $e=n+3$ proposed by Caporossi et al. \cite{CCGH} has been confirmed.
• ##### Article: On the minimal energy of graphs
[Hide abstract]
ABSTRACT: The energy of a graph is the sum of the absolute values of the eigenvalues of the graph which is used to approximate the total π -electron energy of the molecule. In this paper, we determine the (n,e)(n,e)-graphs with minimal energy for e=n+1e=n+1 and n+2n+2, which is giving a complete solution to the conjecture for e=n+1e=n+1 and e=n+2e=n+2 proposed by Caporossi et al. in [4]. Moreover, we determine the graphs with the minimal and second-minimal energies for n−1≤e≤3n2−3, and the unique graph with minimal energy for 3n−52≤e≤2n−4 among all quasi-trees with n vertices and e edges, respectively.
Linear Algebra and its Applications 07/2014; 453:141–153. DOI:10.1016/j.laa.2014.04.009 · 0.98 Impact Factor