Results 91 to 100 of about 9,542 (190)
Extended Idempotent Divisor Graph of Zn [PDF]
Associate graph Л(R) is said to be idempotent divisor graph with vertices set in R*=R-{0} and two non- zero distinct vertices a and b are adjacent if and only if a.b=e, where e an idempotent element non equal 1.
Husam mohammad, Sumaya Mohammed
doaj +1 more source
Computing the Hosoya Index of Some Nanostar Dendrimers
Dendrimers are highly branched macromolecules built up from a monomer, with new branches added in steps until a tree structure is created. The various biological characteristics of dendrimers are a good choice in chemistry, biology, the medical field, and nano-science.
Fateme Movahedi +2 more
openaire +1 more source
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
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
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
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
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
Hosoya polynomial of the subdivided join
The Hosoya polynomials of diameter 1 and diameter 2 graphs are known. We extend the concept of a vertex join of a graph to q-vertex join. Then we give the formula of the Hosoya polynomial of a $q$-vertex join of a complete graph and the formula of the ...
Eunice Gogo Mphako-Banda +1 more
doaj
Laparoscopic Sleeve Gastrectomy for an Obese Patient with Retroperitoneal Schwannoma: A Case Report. [PDF]
Yamada Y +5 more
europepmc +1 more source
Pre-pregnancy body mass index range and prevalence of hypertensive disorders of pregnancy: the Japan environment and children's study. [PDF]
Murata T +15 more
europepmc +1 more source

