Open Access   Article Go Back

MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks

Pradeep Kumar R1 , Soner Nandappa D2 , M.R. Rajesh Kanna3

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-6 , Page no. 874-897, Jun-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i6.874897

Online published on Jun 30, 2018

Copyright © Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna, “MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.874-897, 2018.

MLA Style Citation: Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna "MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks." International Journal of Computer Sciences and Engineering 6.6 (2018): 874-897.

APA Style Citation: Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna, (2018). MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks. International Journal of Computer Sciences and Engineering, 6(6), 874-897.

BibTex Style Citation:
@article{R_2018,
author = {Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna},
title = {MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {6},
Issue = {6},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {874-897},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2271},
doi = {https://doi.org/10.26438/ijcse/v6i6.874897}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i6.874897}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2271
TI - MATLAB Program to Generate Harary energy of Certain Mesh Derived Networks
T2 - International Journal of Computer Sciences and Engineering
AU - Pradeep Kumar R, Soner Nandappa D, M.R. Rajesh Kanna
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 874-897
IS - 6
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
509 248 downloads 118 downloads
  
  
           

Abstract

In this paper, we compute the Harary energy of grid, cylinder, torus, extended grid networks by using MATLAB code. Also we obtained Milovanovi`c bounds for Harary energy of a graph.

Key-Words / Index Term

MATLAB code, Harary energy, Grid, Cylinder, Torus, Extended grid

References

[1] I. Gutman, “The energy of a graph”, Ber. Math-Statist. Sekt. Forschungsz.Graz, 103, 1-22 1978.
[2] I. Gutman, “The energy of a graph: Old and New Results”, ed.by A. Betten, A. Kohnert, R. Laue, A. Wassermann. Algebraic Combinatorics and Applications (Springer, Berlin), pp. 196 – 211, 2001.
[3] D. Cvetkovic, I.Gutman (eds.), “Applications of Graph Spectra”, (Mathematical Insitution,Belgrade,2009).
[4] D. Cvetkovic, I.Gutman (eds.), “Selected Topics on Applications of Graph Spectra”, (Mathematical Institute Belgrade,2011).
[5] I.Gutman, X. Li, J.Zhang, in “Graph Energy”, ed. by M.Dehmer, F.Emmert - Streib. Analysis of Complex Networks. From Biology to Linguistics (Wiley - VCH, Weinheim,2009), pp. 145 174.
[6] Huiqing Liu, Mei Lu and Feng Tian, “Some upper bounds for the energy of graphs”. Journal of Mathematical Chemistry, Vol. 41, No.1, 2007.
[7] B.J.McClelland, “Properties of the latent roots of a matrix: The estimation of -electron energies”,.J. Chem. Phys.54, 640 – 643, 1971.
[8] A. Graovac, I.Gutman, N.Trinajstic,Topological, “Approach to the Chemistry of Conjugated Molecules” (Springer, Berlin,1977)
[9] I. Gutman, O.E. Polansky, “Mathematical Concepts in Organic Chemistry” (Springer, Berlin,1986).
[10] R. L. Graham and H. O. Pollak, “On the addressing problem for loop switching”, Bell Labs Technical Journal, 50, 2495 – 2519, 1971.
[11] G. Indulal, I. Gutman, A. Vijayakumar, “On distance energy of graphs”, MATCH Commun. Math. Comput. Chem., 60, 461 – 472, 2008.
[12] S. B. Bozkurt, A. D. Gungor, B. Zhou, “Note on the distance energy of graphs”, MATCH Commun. Math. Comput. Chem., 64, ,129 – 134, 2010.
[13] A. Dilek Gungor, A. Sinan Cevik, “On the Harary Energy and Harary Estrada Index of a Graph”, MATCH Commun. Math. Comput. Chem. 64, 281-296, 2010.
[14] A. D. Gungor and A. S. Cevik, “On the Harary energy and Harary Estrada index of a graph”, MATCH Communications in Mathematical and in Computer Chemistry, Vol. 64, 281 - 296, 2010.
[15] B.J.McClelland, “Properties of the latent roots of a matrix: The estimation of -electron energies”,.J. Chem. Phys.54, 640 – 643, 1971.
[16] B. Zhou, A. Ilic, “On distance spectral radius and distance energy of graphs”, MATCH Commun. Math. Comput. Chem. 64, 261 – 280, 2010.
[17] M. R. Rajesh Kanna, B. N. Dharmendra and R. Pradeep kumar, “Minimum covering Harary energy of a graph”, International Journal of Pure and Applied Mathematics, 90, No. 3, 371 – 385, 2014.
[18] Bharati Rajan, Sudeep Stephen, Albert William and Cyriac Grigorous, “On LAPLACIAN energy of certain mesh derived networks”, International Journal of Computer Applications, Vol 55, No. 11, 2012.
[19] I. Z. Milovanovic, E. I. Milovanovic, A. Zakic, “A Short note on Graph Energy”, MATH Commun. Math. Comput. Chem, 72, 179-182, 2014.
[20] H. S. Ramane, D. S. Revankar, I. Gutman, S. B. Rao, B. D. Acharya, H. B. Walikar, “Bounds for the distance energy of a graph”, Kragujevac J. Math., 31, 59-68, 2008.