Let G be a simple graph with the vertex set V={v 1,…, vn} and denote by dvi the degree of
the vertex vi. The modified Sombor index of G is the addition of the numbers (dvi 2+ dvj 2) …

For a simple graph with vertex set {v 1, v 2,…, vn} with degree sequence dvi of vertex vi, i= 1,
2,…, n, the inverse sum indeg matrix (ISI-matrix) AISI (G)=(aij) n× n of G is defined by aij …

In this paper, we present a new approach that explores the application of graph energy
variants in chemistry, specifically in the development of platinum anticancer drugs. While …

The Sombor index has gained lot of attention in the recent days for its mathematical
properties and chemical applicabilities. Here, we initiated the novel block number version of …

The comaximal graph Γ (R) of a commutative ring R is a simple graph with vertex set R and
two distinct vertices u and v of Γ (R) are adjacent if and only if u R+ v R= R. In this paper, we …

We study the Sombor index and the Sombor spectral properties of chain graphs. In
particular, an explicit formula for the Sombor index is given, the Sombor eigenvalues are …

In this work, we determine the maximum general Randić index (a general symmetric function
of vertex degrees) for η 0≤ η< 0 among all n-vertex unicyclic graphs with a fixed maximum …

For a simple graph G with vertex set {v 1,⋯, vn} and degree sequence {d 1,⋯, dn}, the
Sombor matrix S (G) of G is an n× n matrix, whose (i, j)-th entry is di 2+ dj 2, if vi and vj are …

Let G=(V (G), E (G)) be a simple graph, where V (G) and E (G) denote the set of its vertices
and edges, respectively. By the size of G, we mean the number of its edges. The maximum …

A unique class of cograph is examined, that is defined recursively as C= C\(n 1\)= K‾ n 1,
and C= C\(n 1, n 2,…, ni\)= C\(n 1, n 2,…, ni− 1\)∪ K ni‾, for 2≤ i≤ k. The Sombor spectrum …