On the topological indices of commuting graphs for finite non-Abelian groups
A topological index is a number generated from a molecular structure (ie, a graph) that
indicates the essential structural properties of the proposed molecule. Indeed, it is an …
indicates the essential structural properties of the proposed molecule. Indeed, it is an …
Counting Polynomials in Chemistry: Past, Present, and Perspectives
DM Joița, MA Tomescu, L Jäntschi - Symmetry, 2023 - mdpi.com
Counting polynomials find their way into chemical graph theory through quantum chemistry
in two ways: as approximate solutions to the Schrödinger equation or by storing information …
in two ways: as approximate solutions to the Schrödinger equation or by storing information …
Certain topological indices of non-commuting graphs for finite non-abelian groups
A topological index is a number derived from a molecular structure (ie, a graph) that
represents the fundamental structural characteristics of a suggested molecule. Various …
represents the fundamental structural characteristics of a suggested molecule. Various …
Hosoya polynomials of power graphs of certain finite groups
Assume that G is a finite group. The power graph P (G) of G is a graph in which G is its node
set, where two different elements are connected by an edge whenever one of them is a …
set, where two different elements are connected by an edge whenever one of them is a …
Several Zagreb indices of power graphs of finite non-abelian groups
Molecular topology can be described by using topological indices. These are quantitative
measures of the essential structural features of a proposed molecule calculated from its …
measures of the essential structural features of a proposed molecule calculated from its …
[PDF][PDF] Aα matrix of commuting graphs of non-abelian groups
For a finite group G and a subset X∅ of G, the commuting graph, indicated by G= C (G, X), is
the simple connected graph with vertex set X and two distinct vertices x and y are edge …
the simple connected graph with vertex set X and two distinct vertices x and y are edge …
[PDF][PDF] On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings
For a simple connected graph G of order n, the distance signless Laplacian matrix is defined
by DQ (G)= D (G)+ Tr (G), where D (G) and Tr (G) is the distance matrix and the diagonal …
by DQ (G)= D (G)+ Tr (G), where D (G) and Tr (G) is the distance matrix and the diagonal …
Sombor index and eigenvalues of comaximal graphs of commutative rings
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 …
two distinct vertices u and v of Γ (R) are adjacent if and only if u R+ v R= R. In this paper, we …
Degree and distance based topological descriptors of power graphs of finite non-abelian groups
A topological descriptor is a numerical value derived from the molecular structure that
encapsulates the most important structural characteristics of the molecule under …
encapsulates the most important structural characteristics of the molecule under …
The expected values of the total numbers of independent edge sets and independent sets in random alpha-type pentagonal chains
L Wei, H Bian, H Yu - Heliyon, 2023 - cell.com
A independent edge set of G containing mutually independent edges is also called a
matching of G. The total numbers of matchings and independent sets of a graph G, namely …
matching of G. The total numbers of matchings and independent sets of a graph G, namely …