Construction of $L$-Borderenergetic Graphs


Download PDF

Authors: S. K. VAIDYA AND K. M. POPAT

DOI: 10.46793/KgJMat2106.873V

Abstract:

If a graph G of order n has the Laplacian energy same as that of complete graph Kn then G is said to be L-borderenergeic graph. It is interesting and challenging as well to identify the graphs which are L-borderenergetic as only few graphs are known to be L-borderenergetic. In the present work we have investigated a sequence of L-borderenergetic graphs and also devise a procedure to find sequence of L-borderenergetic graphs from the known L-borderenergetic graph.



Keywords:

Borderenergetic, L-borderenergetic, energy.



References:

[1]   R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, New York, 2000.

[2]   D. M. Cvetković, M. Doob and H. Sachs, Spectra of Graphs: Theory and Application, Academic Press, New York, 1980.

[3]   B. Deng and X. Li, On L-Borderenergetic Graphs with maximum degree at most 4, MATCH Commun. Math. Comput. Chem. 79 (2018), 303–310.

[4]   S. Elumalai and M. A. Rostami, Correcting the number of L-borderenergetic graphs of order 9 and 10, MATCH Commun. Math. Comput. Chem. 79 (2018), 311–319.

[5]   S. Gong, X. Li, G. Xu, I. Gutman and B. Furtula, Borderenergetic graphs, MATCH Commun. Math. Comput. Chem. 74 (2015), 321–332.

[6]   I. Gutman, The energy of a graph, Ber. Math.-Statist. Sekt. Forschungszentrum Graz 103 (1978), 1–22.

[7]   I. Gutman and B. Zhou, Laplacian energy of a graph, Linear Algebra Appl. 414 (2006), 29–37.

[8]   S. Lang, Algebra, Springer, New York, 2002.

[9]   Q. Tao and Y. Hou, A computer search for the L-borderenergetic graphs, MATCH Commun. Math. Comput. Chem. 77 (2017), 595–606.

[10]   F. Tura, L-borderenergetic graphs, MATCH Commun. Math. Comput. Chem. 77 (2017), 37–44.

[11]   F. Tura, L-borderenergetic graphs and normalized Laplacian energy, MATCH Commun. Math. Comput. Chem. 77 (2017), 617–624.

[12]   H. B. Walikar, H. S. Ramane and P. Hampiholi, On the energy of a graph, in: R. Balakrishnan, H. M. Mulder, A. Vijayakumar (Eds.), Graph Connections, Allied Publishers, New Delhi, 1999, 120–123.