One of the major branches of mathematical chemistry is the chemical graph theory that
employs graph invariants to demonstrate chemical phenomena mathematically. Topological …

The spectral graph theory explores connections between combinatorial features of graphs
and algebraic properties of associated matrices. The neighborhood inverse sum indeg (NI) …

Let G be a graph and di be the degree of a vertex vi in G. For a symmetric real function f (x,
y), one can get an edge-weighted graph in such a way that for each edge vivj of G, the …

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 …

Let G be a graph and di denote the degree of a vertex vi in G, and let f (x, y) be a real
symmetric function. Then one can get an edge-weighted graph in such a way that for each …

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 …

In a graph G, if di is the degree of a vertex vi, the geometric-arithmetic matrix GA (G) is a
square matrix whose (i, j)-th entry is 2 didjdi+ dj whenever vertices i and j are adjacent and 0 …

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 …

For a simple graph with vertex set {v 1, v 2,…, vn} and degree sequence dvii= 1, 2,…, n, the
inverse sum indeg matrix (ISI matrix) A ISI (G)=(aij) of G is a square matrix of order n, where …