Computation of irregularity indices of certain computer networks (Q2007075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7259581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of irregularity indices of certain computer networks |
scientific article; zbMATH DE number 7259581 |
Statements
Computation of irregularity indices of certain computer networks (English)
0 references
12 October 2020
0 references
Summary: 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.
0 references
0 references
0.88836133
0 references
0.8877072
0 references
0 references
0.86020106
0 references
0 references
0 references
