On Detour Distance Laplacian Energy

Authors

  • V. Kaladevi PG and Research Department of Mathematics, Bishop Heber College, Tiruchirappalli 620017, Tamil Nadu
  • A. Abinayaa PG and Research Department of Mathematics, Bishop Heber College, Tiruchirappalli 620017, Tamil Nadu

DOI:

https://doi.org/10.26713/jims.v9i3.934

Keywords:

Detour distance Laplacian matrix, Detour distance Laplacian Eigen value, Detour distance Laplacian energy

Abstract

The Detour distance laplacian energy of a simple connected graph \(G\) is defined as the sum of the absolute values of the Eigen values of the detour distance laplacian matrix of \(G\). In this paper, the bounds for detour distance laplacian energy is obtain and also the detour distance laplacian energy of standard graphs and the Cartesian product of certain graphs with \(P_2\) are computed.

Downloads

Download data is not yet available.

References

C. Adiga, A. Bayad, I. Gutman and S.A. Srinivas, The minimum coveringenergy of a graph, Kragujevac J. Sci. 34 (2012), 39 – 56.

C. Adiga and M. Smitha, On maximum degree energy of a graph, Int. J. Contemp. Math. Sciences 4 (8) (2009), 385 – 396.

M. Aouchiche and P. Hansen, Two Laplacians for the distance matrix of agraph, Linear Algebra Appl. 439 (2013), 21 – 33.

S.K. Ayyasamy and S. Balachandran, On detour spectra of some graphs, World Academy of Science, Engineering and Technology 4, 2010-07-21.

R. Balakrishnan, The energy of a graph, Lin. Algebra Appl. 387 (2004), 287 – 295.

S.B. Bozkunt, A.D. Gungor and B. Zhou, Note on the distance energy of graphs, MATCH Commun. Math Comput. Chem. 64 (2010), 129 – 134.

F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood (1990).

M. Edelberg, M.R. Garey and R.L. Graham, On the distance matrix of a tree, Discr. Math. 14 (1976), 23 – 29.

A.D. Gunger and S.B. Bozkurt, On the distance spectral radius and distance energy of graphs, Lin. Multilin. Algebra 59 (2011), 365 – 370.

I. Gutman, The energy of a graph, Ber. Math. Statist. Sekt. for Schungsz. Ghaz 103 (1978), 1 – 22.

I. Gutman, The energy of a graph: old and new results, in Algebraic Combinatorics and Applications, A. Betten, A. Kobnert, R. Lave and A. Wassermann (eds.), Springer, Berlin (2001), 196 – 211.

R.L. Graham and L. Lovasz, Distance matrix polynomials of trees, Adv. Math. 29 (1978), 60 – 88.

H. Hua, On minimal energy of unicycle graphs with prescribed girth and pendent vertices, MATCH Commun. Math. Comput. Chem. 57 (2007), 351 – 361.

G. Indulal, Sharp bounds on the distance spectral radius and the distance energy of graphs, Lin. Algebra Appl. 430 (2009), 106 – 113.

G. Indulal, I. Gutman and A. Vijayakumar, On distance energy of graphs, MATCH Commun. Math. Comput. Chem. 60 (2008), 461 – 472.

J. Yang, L. You and I. Gutman, Bounds on the distance laplacian energy of graphs, Kragujevac Journal of Mathematics 37 (2) (2013), 245 – 255.

J.H. Koolen and V. Moulton, Maximal Energy Graphs, Adv. Appl. Math. 26 (2001), 47 – 52.

I. Lukovits, The detour index, Croat. Chem. Acta 69 (1996), 873 – 882.

I. Lukovits and M. Razinger, On calculation of the detour index, J. Chem. Inf. Comput. Sci. 37 (1997), 283 – 286.

H.S. Ramane, D.S. Revankar, I. Gutman, S.B. Rao, B.D. Acharya and H.B. Walikar, Bounds for the distance energy of a graph, Kragujevac J. Math. 31 (2008), 59 – 68.

N. Trinajstic, S. Nikolic, B. Lucic, D. Amic and Z. Mihalic, The detour matrix in chemistry, J. Chem. Inf. Comput. Sci. 37 (1997), 631 – 638.

B. Zohu and X. Cai, On detour index, MATCH Commun. Math. Comput. Chem. 63 (2010), 199 – 210.

Downloads

Published

2017-10-31
CITATION

How to Cite

Kaladevi, V., & Abinayaa, A. (2017). On Detour Distance Laplacian Energy. Journal of Informatics and Mathematical Sciences, 9(3), 721–732. https://doi.org/10.26713/jims.v9i3.934

Issue

Vol. 9 No. 3 (2017)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.