Distance Measurements Related to Cartesian Product of Cycles

Xiaoli Qiang, Saima Nazeer, Yu-Ming Chu, Muhammad Awais Umar, Imrana Kousar, Ammara Sehar and Ji Gao

Journal of Mathematics, 2020, vol. 2020, 1-6

Abstract: Graph theory and its wide applications in natural sciences and social sciences open a new era of research. Making the graph of computer networks and analyzing it with aid of graph theory are extensively studied and researched in the literature. An important discussion is based on distance between two nodes in a network which may include closeness of objects, centrality of objects, average path length between objects, and vertex eccentricity. For example, (1) disease transmission networks: closeness and centrality of objects are used to measure vulnerability to particular disease and its infectivity; (2) routing networks: eccentricity of objects is used to find vertices which form the periphery objects of the network. In this manuscript, we have discussed distance measurements including center, periphery, and average eccentricity for the Cartesian product of two cycles. The results are obtained using the definitions of eccentricity, radius, and diameter of a graph, and all possible cases (for different parity of length of cycles) have been proved.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/6371694.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/6371694.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:6371694

DOI: 10.1155/2020/6371694

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().