Abstract
A graph is said to be a regular graph if all its vertices have the same degree; otherwise, it is irregular. In general, irregularity indices are used for computational analysis of nonregular graph topological composition. The creation of irregular indices is based on the conversion of a structural graph into a total count describing the irregularity of the molecular design on the map. It is important to be notified how unusual a molecular structure is in various situations and problems in structural science and chemistry. In this paper, we will compute irregularity indices of certain networks.
Highlights
In mathematics, graph theory can be used to describe different types of graphs that are computational structures
An irregularity index is a statistical value connected with a graph that defines a graph’s irregularity. e theory of networks is a part of computer science and network engineering graph theory
The creation of irregular indices is based on the conversion of a structural graph into a total count describing the irregularity of the molecular design on the map [3, 4]
Summary
Graph theory can be used to describe different types of graphs that are computational structures. Wiener is the pioneer of topological indices; he discovered the first topological index and found out the boiling point of a compound (paraffin, a member of the alkane family) in 1947. E graph invariant denoted by M1(G) is called the first Zagreb index, which is equal to the sum of square of the degrees of the vertices of a graph; it was introduced by Trinjastic and Gutman in 1972 [9]. E second Zagreb index is a graph invariant denoted by M2(G) which is defined as the aggregate of the product of degrees of connected pairs of vertices of the molecular compound, and it was introduced by Trinjastic and Gutman in 1972. We compute irregularity indices for certain networks
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
