Results 1 to 10 of about 29 (29)
Hosoya properties of the commuting graph associated with the group of symmetries
A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
On inverse sum indeg energy of graphs
For a simple graph with vertex set {v1,v2,…,vn}\left\{{v}_{1},{v}_{2},\ldots ,{v}_{n}\right\} and degree sequence dvii=1,2,…,n{d}_{{v}_{i}}\hspace{0.33em}i=1,2,\ldots ,n, the inverse sum indeg matrix (ISI matrix) AISI(G)=(aij){A}_{{\rm{ISI}}}\left(G ...
Jamal Fareeha +2 more
doaj +1 more source
Computing the Hosoya Polynomial of M‐th Level Wheel and Its Subdivision Graph
The determination of Hosoya polynomial is the latest scheme, and it provides an excellent and superior role in finding the Weiner and hyper‐Wiener index. The application of Weiner index ranges from the introduction of the concept of information theoretic analogues of topological indices to the use as major tool in crystal and polymer studies.
Peng Xu +6 more
wiley +1 more source
In the study of chemical graph theory, an enormous number of research analyses have confirmed that the characteristics of chemicals have a nearby connection with their atomic structure.
Chen Shu-Bo +4 more
doaj +1 more source
Non-commuting graph of the dihedral group determined by Hosoya parameters
Hosoya introduced the concept of graph terminologies in chemistry and provide a modeling for molecules. This modeling leads to predict the chemical properties of molecules, easy classification of chemical compounds, computer simulations and computer ...
Muhammad Salman +4 more
doaj +1 more source
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source
On the first Zagreb index of graphs with Self-Loops
Some of the most comprehensively studied degree-based topological indices are the Zagreb indices. The first Zagreb index [Formula: see text] of a graph G is defined as the sum of squares of the degrees of the vertices.
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Some topological indices of dendrimers determined by their Banhatti polynomials
Several properties of chemical compounds in a molecular structure can be determined with the aid of mathematical languages provided by various types of topological indices.
Chu Zheng-Qing +6 more
doaj +1 more source
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
The number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj +1 more source
Graph theory combined with chemistry provides a strong framework for modeling and assessing chemical compounds. By representing molecules as graphs and applying topological indices, chemists can gain profound insights into the physical and chemical characteristics of compounds.
Kalpana R. +2 more
wiley +1 more source

