Wiener polarity and Wiener index of double generalized Petersen graph
TanveerIqbala, SyedAhtsham Ul Haq Bokharya, GhulamAbbasa, JamelBailib,c, HijazAhmadd,e, HafsahTabassumf, SaqibMurtazaf, ZubairAhmadg, Xiao-ZhongZhangh,⁎
a
Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, Pakistan
b
Department of Computer Engineering, College of Computer Science, King Khalid University, Abha 61413, Saudi Arabia
c
Higher Institute of Applied Science and Technology of Sousse (ISSATS), Cité Taffala (Ibn Khaldoun) 4003 Sousse, University of Souse, Tunisia
d
Near East University, Operational Research Center in Healthcare, Near East Boulevard, PC: 99138 Nicosia/Mersin 10, Turkey
e
Section of Mathematics, International Telematic University Uninettuno, Corso Vittorio Emanuele II, 39, 00186 Roma, Italy
f
Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha Uthit Rd., Bang Mod, Thung Khru, Bangkok 10140, Thailand
g
Department of Mathematics and Physics, University of Campania “Luigi Vanvitelli”, Caserta 81100, Italy
h
School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, China
Disclaimer: This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.
Peer review under responsibility of King Saud University.
Abstract
A topological index is a numerical parameter of a graph which characterizes some of the topological properties of the graph. The concepts of Wiener polarity index and Wiener index were established in chemical graph theory by means of the distances. The double generalized Petersen graph denoted by is obtained by attaching the vertices of outer pendent vertices to inner pendent vertices lying at distance . The length of the outer and inner cycle is , thus the number of vertices are and the number of edges in the are . In this paper, the Wiener polarity index of for and for is computed. Further, the Wiener index of , for is determined.
Keywords
Double Generalized Petersen Graph
Wiener Polarity Index
Wiener Index
05C22
05C12
1
1 Introduction
Let be a simple, connected, undirected graph with a vertex set and an edge set . The distance between two vertices and , denoted by is the length of the shortest path between the vertices and in . The diameter of a connected graph is the length of any longest geodesic. The degree of a vertex in is the number of edges incident to and is denoted by (Adnan et al., 2021; Buckley and Harary, 1990).
In the modern age, network structures have great significance in the field of chemistry, information technology, communication, and physical structures. A topological index of graph G is a numerical quantity that describes the topology of the graph. It reflects the theoretical properties of chemical compounds when applied to the molecular structure of the chemical compounds. Several topological indices have been proposed so far by various researchers.The Wiener index was the first and most studied topological index (see for details in (Wiener, 1947)). Wiener demonstrates that the Wiener index number is strongly related to the boiling points of alkane molecules. In chemistry, it was the first molecular topological index used. Since then, many indices that relate topological indices to different physical properties have been introduced in (Bokhary et al., 2021; Bokhary and Adnan, 2021; Ul Haq Bokhary et al., 2021).
Generalized Petersen Graphs and Double Generalized Petersen graphs are extensively studied graph networks. Many graph properties like metric dimension, partition dimension, different kinds of graph labelings, etc of this family are already been explored. In (Liu et al., 2017), Hamiltonian cycles is studied.
The Wiener polarity index of is denoted by and defined as
Consider a graph consisting of two cycles; one is called an outer and the other is an inner cycle. The vertex set of outer and inner cycles is denoted by and , respectively. Let, each of the vertices of the cycles are attached to a pendant vertex. The pendant vertices attached to the outer cycle are called outer pendent vertices whereas the inner pendent vertices are the vertices are attached to the inner cycle. The vertex set of outer and inner pendent vertices is denoted by and , respectively. The double generalized Petersen graph denoted by is a graph obtained by attaching outer pendent vertices to inner pendent vertices lying at distance . The vertices of are defined as follows:
, , , for
The edge set is defined as follows:
The construction follows that the order of the graph is . The graph of is depicted in Fig. 1. (See Fig 2 Fig 3)
Fig. 1
The double generalized Petersen graph
Fig. 2
Graphical representation of for different values of
Fig. 3
Graphical representation of for different values of
In this paper, the Wiener polarity and the Wiener index of dthe graphs , where and be the nonnegative integers are investigated. Throughout this paper, the Wiener polarity index and the Wiener index of double generalized Petersen graph will be denoted by and , respectively. All the indices that follow henceforth are taken under modulo .
2
2 The Wiener polarity index of Double Generalized Petersen graphs
In this section, the of is computed for different values of and .
Theorem 2.1
For, the Wiener polarity indexis.
Proof. For , it is easy to verify the results. For , let be an arbitrary vertex of . Then, the vertex can belong to either of the set or :
Case 1
Let, thenbe one of the outer vertex. The vertices, , , , , ,, are the vertices which have a distance of three from. There arevertices that have a distance of three from the vertices of the set.
Case 2
Let. In this case, be one of the inner vertex. The vertices, , , , , , ,are the vertices at distance three from each. So, vertices fromthat are yet to be counted.
Case 3
Let, thenis one of the inner vertexThe vertices, , , , , , , are the vertices at distance of three from each vertex of. So, 3 vertices fromwhich are yet to be counted.
Case 4
Let, thenbe one of the inner vertexThe vertices, , , , ,,, are the vertices at distance of three. So, vertices fromwhich are yet to be counted.The above cases imply that.
Theorem 2.2
For,where.
Proof. For , let be an arbitrary vertex of . Then, the vertex can belong to either of the set or :
If , then is one of the outer vertex The vertices , , , , , , , , , and are the vertices at distance three from each . It is clear that and are the vertices that have the largest gap from the vertex . Thus, the maximum value of for which the vertices and can be equal is but . Therefore, and are distinct vertices and hence, all the vertices mentioned above are distinct. Since, , therefore there are total vertices that have a distance of three from the set .
If the vertex belongs to set or . Without loss of generality, one can suppose that , then is one of the inner vertex . The vertices , , , , , , , , are the vertices at distance three. The vertices and have the largest gap from the vertex . Thus, the maximum value of for which the vertex and are equal is but . Therefore, and are distinct vertices and hence all the vertices mentioned above are distinct. Since of these vertices belong to a set and are already counted, therefore there are total vertices that are yet to be counted and have a distance of three from the vertices of the set . Similarly, for each , there are vertices with distance and out of them belong to set and belong to a set . Therefore there are vertices that are yet to be counted and have a distance of three from .
Finally, if then for any arbitrary vertex , the vertex is the vertex with distance three and is not counted before. Thus, there are new vertices having a distance of three from a set . Therefore,
2.1
2.1 The Wiener index of Double Generalized Petersen Graphs
In this section, the for is computed, where and are positive integers. Let (x, y) and be the minimum and maximum distances between any pair of vertices and
Theorem 2.3
For,
Proof. The equation for calculating the Wiener index is
(1)
The proof is divided into two cases.
Case 1
is even.
If , then There are and pairs of vertices when and respectively. Therefore,
(2)
If and or and , then There are and pairs of vertices when and respectively. Thus,
(3)
If and or and . In this case, () = 2 and . There are and pairs of vertices when and respectively. Thus,
(4)
If and , then () = 3 and There are pairs of vertices when and if or . Thus,
(5)
If or . In both these cases, () = 2 and There are pairs of vertices when and if . Therefore,
(6)
If and , then () = 1 and It is important to note that there is no pair which have a distance of three. There are pairs of vertices when or and if the . So,
In this section, the graphical representation of and of and for different valuers of are determined. These compact formulas are easy to understand and draw and can be beneficial to the people working in the area.
4
4 Concluding remarks
The Generalized Petersen Graph and Double Generalized Petersen graphs are extensively studied families in graph theory. We have extended the study of topological indices by finding the Wiener index and the Wiener polarity indices of the Double Generalized Petersen Graph which is constructed from the Generalized Petersen Graph. We close this section by raising the following questions.
Open Problems
Determine the Wiener Index of Double Generalized Petersen Graph for
Explore the other topological properties of .
Funding
This research work was supported by the Deanship of Scientific Research at King Khalid University under Grant number RGP. 1/155/42.
Acknowledgement
The Authors extend their thanks to the Deanship of Scientific Research at King Khalid University for funding this work through the large group research program under grant number RGP. 2/112/43.
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
References
AdnanM.,
BokharyS.A.U.H.,
ImranM.,
.On Wiener polarity index and wiener index of certain triangular networks.J. Chem.. 2021;2021
BokharyS.A.U.H.,
AdnanS.M.K.,
CancanM.,
.On topological indices and QSPR analysis of drugs used for the treatment of breast cancer.Polycyclic Aromatic Compounds. 2021;42:6233-6253.
We use cookies on our website to give you the most relevant experience by remembering your preferences and repeat visits. By clicking “Accept”, you consent to the use of ALL the cookies.
This website uses cookies to improve your experience while you navigate through the website. Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may affect your browsing experience.
Necessary cookies are absolutely essential for the website to function properly. This category only includes cookies that ensures basic functionalities and security features of the website. These cookies do not store any personal information.
Functional cookies help to perform certain functionalities like sharing the content of the website on social media platforms, collect feedbacks, and other third-party features.
Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors.
Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics the number of visitors, bounce rate, traffic source, etc.
Advertisement cookies are used to provide visitors with relevant ads and marketing campaigns. These cookies track visitors across websites and collect information to provide customized ads.