Zagreb connection indices in structure property modelling
One of the major branches of mathematical chemistry is the chemical graph theory that
employs graph invariants to demonstrate chemical phenomena mathematically. Topological …
employs graph invariants to demonstrate chemical phenomena mathematically. Topological …
[HTML][HTML] On neighborhood inverse sum indeg energy of molecular graphs
The spectral graph theory explores connections between combinatorial features of graphs
and algebraic properties of associated matrices. The neighborhood inverse sum indeg (NI) …
and algebraic properties of associated matrices. The neighborhood inverse sum indeg (NI) …
Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
X Li, N Yang - Linear Algebra and its Applications, 2024 - Elsevier
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 …
y), one can get an edge-weighted graph in such a way that for each edge vivj of G, the …
[HTML][HTML] On some topological indices defined via the modified Sombor matrix
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) …
the vertex vi. The modified Sombor index of G is the addition of the numbers (dvi 2+ dvj 2) …
[HTML][HTML] Inverse sum indeg index (energy) with applications to anticancer drugs
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 …
2,…, n, the inverse sum indeg matrix (ISI-matrix) AISI (G)=(aij) n× n of G is defined by aij …
Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
X Li, N Yang - Discrete Applied Mathematics, 2023 - Elsevier
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 …
symmetric function. Then one can get an edge-weighted graph in such a way that for each …
[HTML][HTML] General Randić Index of Unicyclic Graphs and Its Applications to Drugs
A Altassan, M Imran - Symmetry, 2024 - mdpi.com
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 …
of vertex degrees) for η 0≤ η< 0 among all n-vertex unicyclic graphs with a fixed maximum …
On the spread of the geometric-arithmetic matrix of graphs
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 …
square matrix whose (i, j)-th entry is 2 didjdi+ dj whenever vertices i and j are adjacent and 0 …
On spectral spread and trace norm of Sombor matrix
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 …
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 …
[HTML][HTML] On inverse sum indeg energy of graphs
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 …
inverse sum indeg matrix (ISI matrix) A ISI (G)=(aij) of G is a square matrix of order n, where …