Small-World Networks with Unitary Cayley Graphs for Various Energy Generation
نویسندگان
چکیده
Complex networks have been a prominent topic of research for several years, spanning wide range fields from mathematics to computer science and also social biological sciences. The eigenvalues the Seidel matrix, Signless Laplacian energy, Maximum Minimum Degree Sum energy Distance Unitary Cayley graphs [UCG] calculated. Low-power devices must be able transfer data across long distances with low delay reliability. To overcome this drawback small-world network depending on unitary graph is proposed decrease increase reliability used create analyze communication. Small-world based basic construction are highly adaptable. simulation result shows that has shorter more reliable. Furthermore, maximum lowered by 40%.
منابع مشابه
On the Energy of Unitary Cayley Graphs
In this note we obtain the energy of unitary Cayley graph Xn which extends a result of R. Balakrishnan for power of a prime and also determine when they are hyperenergetic. We also prove that E(Xn) 2(n−1) ≥ 2 4k , where k is the number of distinct prime divisors of n. Thus the ratio E(Xn) 2(n−1) , measuring the degree of hyperenergeticity of Xn, grows exponentially with k.
متن کاملOn Unitary Cayley Graphs
AssrRAcr. We deal with a family of undirected Cayley graphs X. which are unions of disjoint Hamilton cycles, and some of their properties, where rz runs over the positive integers. It is proved that X-is a bipartite graph when n is even. If n is an odd number, we count the number of different colored triangles in Xn.
متن کاملCayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are high local clustering and small average internode distance. A great deal of previous research on small-world networks has been based on probabilistic methods, with a rather small number of researchers advocating determi...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملUnitary Cayley Graphs for Finite Rings
Given an integer n, one defines the unitary Cayley graph, denoted Cay(Zn,Zn), to be the graph whose vertex set is Zn, the integers modulo n, with an edge between two vertices x, y if x− y is a unit in (the ring) Zn. Unitary Cayley graphs have been studied as objects of independent interest (see, for example, [3], [2], [7], [8], [9]) but are of particular relevance in the study of graph represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer systems science and engineering
سال: 2023
ISSN: ['0267-6192']
DOI: https://doi.org/10.32604/csse.2023.032303