Results 31 to 40 of about 13,778,255 (132)
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 Zafar Abbas +4 more
core +1 more source
Nanomaterials find application in electronics, drugs, and biology among other disciplines. Benzenoid systems with their homogeneous structures are especially fit for computer study because of their predictable geometries. This work investigates computational analysis of benzenoid systems using valency‐based entropy measurements and degree‐based ...
Muhammad Kamran +5 more
wiley +1 more source
Numerical Solution of Volterra Integral Equations Using Hosoya Polynomial
In this study, Volterra integral equation is solved by Hosoya Polynomials. The solutions obtained with Hosoya method were compared on the figure and table. And error analysis was done.
Mustafa Ali Dokuyucu +2 more
core +1 more source
The prediction of molecular activity plays an important role in drug discovery. Various approaches have been devised to predict anti‐HIV activity based on topological indices. This study proposes Steiner 3‐eccentric connectivity index and Steiner 3‐eccentric distance sum and applies them to predict anti‐HIV activity of a molecule.
Xingfu Li, Arpan Hazra
wiley +1 more source
Nonassociative algebra presents multiple options for comprehending and dealing with difficulties in graph theory, artificial intelligence, and cryptography. Its distinctive traits introduce genuine concepts and procedures not found in conventional associative algebra, yielding to new results from studies and breakthroughs in multiple disciplines ...
Mohammad Mazyad Hazzazi +5 more
wiley +1 more source
Note on the smallest root of the independence polynomial [PDF]
One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core +1 more source
In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
On Terminal Hosoya Polynomial of Some Thorn Graphs
In this paper we obtain the terminal Hosoya polynomial for caterpillers, thorn stars and thorn rings. These results generalizes the existing results.
Gouramma A. Gudodagi (5759582) +2 more
core +1 more source
M‐Polynomial and NM‐Polynomial Methods for Topological Indices of Polymers
Topological indices (TIs) are numerical tools widely applied in chemometrics, biomedicine, and bioinformatics for predicting diverse physicochemical attributes and biological activities within molecular structures. Despite their significance, the challenges in deriving TIs necessitate novel approaches.
Mohammed Yasin H +4 more
wiley +1 more source
Hosoya-Wienerov polinom za utežene grafove [PDF]
Formulas for the Wiener number and the Hosoya-Wiener polynomial of edge and vertex weighted graphs are given in terms of edge and path contributions. For a rooted tree, the Hosoya-Wiener polynomial is expressed as a sum of vertex contributions.
Zmazek, Blaž, Žerovnik, Janez
core

