Computation of Irregularity Indices of Certain Computer Networks

Jiangnan Liu, Lulu Cai, Abaid ur Rehman Virk, Waheed Akhtar, Shahzad Ahmed Maitla and Yang Wei

Mathematical Problems in Engineering, 2020, vol. 2020, 1-17

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/2797286.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/2797286.xml (text/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:jnlmpe:2797286

DOI: 10.1155/2020/2797286

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().