Results 81 to 90 of about 3,633,781 (192)
The higher-order matching polynomial of a graph
Given a graph G with n vertices, let p(G,j) denote the number of ways j mutually nonincident edges can be selected in G. The polynomial M(x)=∑j=0[n/2](−1)jp(G,j)xn−2j, called the matching polynomial of G, is closely related to the Hosoya index introduced
Oswaldo Araujo +3 more
doaj +1 more source
Computing the Hosoya Index of Catacondensed Hexagonal Systems
The Hosoya index of a graph G is defined as Z (G) = P k≥0 m (G, k), where m (G, k) the number of ways in which k mutually independent edges can be selected in G. In this article we introduce the Hosoya vector of a graph at a given edge.
Rada Rincón, Juan Pablo +2 more
core
On topological indices and QSPR analysis of some drugs used for treating Coronavirus patients
A topological index is a real number obtained from the molecular graph structure. It can predict the physicochemical and biological properties of many anticoronavirus drugs.
Hassan Ibrahim +2 more
doaj +1 more source
Treatment of Restless Legs Syndrome in Dialysis Patients
Seminars in Dialysis, Volume 39, Issue 4, Page 207-209, July/August 2026.
Kenji Sakurai +4 more
wiley +1 more source
Double hexagonal chains with maximal Hosoya index and minimal Merrifield-Simmons index
It is well known that the two graph invariants, '' the Hosoya index '' and '' the Merrifield-Simmons index '' are important ones in structural chemistry.
Ren,H, Zhang,F, 张福基
core
The role of physicochemical and topological parameters in drug design
Quantitative structure activity relationship (QSAR) is a widely used tool in rational drug design that establishes relationships between the physicochemical and topological descriptors of ligands and their biological activities. Obtained QSAR models help
Janki Darlami, Shweta Sharma
doaj +1 more source
The Wiener Index and the Hosoya Polynomial of the Jahangir Graphs [PDF]
Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path between vertices u,v V(G) is called the distance, d(u,v), between the vertices u,v.
openaire +1 more source
The Expected Values of Hosoya Index and Merrifield-Simmons Index of Random Hexagonal Cacti [PDF]
Hosoya index and Merrifield-Simmons index are two well-known topological descriptors that reflex some physical properties, boiling point or heat of formation for instance, of bezenoid hydrocarbon compounds.
Jiarasuksakun, Thiradet +4 more
core
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
Solution to a Conjecture on the Permanental Sum
Let G be a graph with n vertices and m edges. A(G) and I denote, respectively, the adjacency matrix of G and an n by n identity matrix. For a graph G, the permanent of matrix (I+A(G)) is called the permanental sum of G.
Tingzeng Wu, Xueji Jiu
doaj +1 more source

