Open Access iconOpen Access

ARTICLE

crossmark

Small-World Networks with Unitary Cayley Graphs for Various Energy Generation

C. Thilaga*, P. B. Sarasija

Department of Mathematics, Noorul Islam Centre for Higher Education, Kumaracoil, 629180, India

* Corresponding Author: C. Thilaga. Email: email

Computer Systems Science and Engineering 2023, 45(3), 2773-2782. https://doi.org/10.32604/csse.2023.032303

Abstract

Complex networks have been a prominent topic of research for several years, spanning a wide range of fields from mathematics to computer science and also to social and biological sciences. The eigenvalues of the Seidel matrix, Seidel Signless Laplacian matrix, Seidel energy, Seidel Signless Laplacian energy, Maximum and Minimum energy, Degree Sum energy and Distance Degree energy of the Unitary Cayley graphs [UCG] have been calculated. Low-power devices must be able to transfer data across long distances with low delay and reliability. To overcome this drawback a small-world network depending on the unitary Cayley graph is proposed to decrease the delay and increase the reliability and is also used to create and analyze network communication. Small-world networks based on the Cayley graph have a basic construction and are highly adaptable. The simulation result shows that the small-world network based on unitary Cayley graphs has a shorter delay and is more reliable. Furthermore, the maximum delay is lowered by 40%.

Keywords


Cite This Article

C. Thilaga and P. B. Sarasija, "Small-world networks with unitary cayley graphs for various energy generation," Computer Systems Science and Engineering, vol. 45, no.3, pp. 2773–2782, 2023. https://doi.org/10.32604/csse.2023.032303



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 804

    View

  • 421

    Download

  • 0

    Like

Share Link