Department of Informatics University of Bergen P. O. Box 7803, Bergen, 5020, Norway
Nima Ghanbari, Mohammad Ali Dehghanizadeh, Saeid Alikhani
In this paper: The overall variation in vertex connections within a graph, known as the total irregularity, is quantified by summing half the absolute differences between the degrees of every vertex pair. This study...
Nima Ghanbari, Saeid Alikhani
In this paper: The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of √d2i +d2j, where di is the degree of the i-th vertex. It has been conceived us...
Nima Ghanbari, Saeid Alikhani
In this paper: Let G = (V, E) be a finite simple graph. The Sombor index SO(G) of G is defined as ΣuvϵE(G) √d2u+d2v, where du is the degree of vertex u in G. We consider the Sombor polynomial (function) as S(G, x)...
Install TARU PUBLICATIONSFaster access from your home screen