Article

Full entry | PDF   (0.2 MB)
Keywords:
Laplacian eigenvalues; Laplacian energy; chromatic number; complement
Summary:
Kragujevac (M. L. Kragujevac: On the Laplacian energy of a graph, Czech. Math. J. {\it 56}({\it 131}) (2006), 1207--1213) gave the definition of Laplacian energy of a graph $G$ and proved $LE(G)\geq 6n-8$; equality holds if and only if $G=P_n$. In this paper we consider the relation between the Laplacian energy and the chromatic number of a graph $G$ and give an upper bound for the Laplacian energy on a connected graph.
References:
[1] Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications. North-Holland New York (1976). MR 0411988
[2] Brooks, R. L.: On coloring the nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941), 194-197. MR 0012236
[3] Brualdi, R. A., Goldwasser, J. L.: Permanent of the Laplacian matrix of trees and bipartite graphs. Discrete Math. 48 (1984), 1-21. DOI 10.1016/0012-365X(84)90127-4 | MR 0732197 | Zbl 0533.05043
[4] Gutman, I.: Acyclic systems with extremal Hückel $\pi$-electron energy. Theoret. Chim. Acta 45 (1977), 79-87. DOI 10.1007/BF00552542
[5] Gutman, I.: The energy of a graph. Ber. Math.-Stat. Sekt. Forschungszent. Graz 103 (1978), 1-22. MR 0525890 | Zbl 0402.05040
[6] Gutman, I.: Acyclic conjugated molecules, trees and their energies. J. Math. Chem. 1 (1987), 123-143. MR 0895532
[7] Lazi'c, M. L.: On the Laplacian energy of a graph. Czechoslovak Math. J. 56 (2006), 1207-1213. DOI 10.1007/s10587-006-0089-2 | MR 2280804 | Zbl 1172.80301

Partner of