Results 51 to 60 of about 268,469 (172)
Topological Aspects of Quadratic Graphs and M‐Polynomials Utilizing Classes of Finite Quasigroups
Journal of Mathematics, Volume 2026, Issue 1, 2026.Material science, drug design and toxicology studies, which relate a molecule’s structure to its numerous properties and activities, are studied with the use of the topological index. Graphs with finite algebraic structure find extensive applications in fields such as mathematics, elliptic curve cryptography, physics, robotics and information theory ...
Mohammad Mazyad Hazzazi +5 more
wiley +1 more source
Novel high-efficiency 2D position-sensitive ZnS:Ag/6LiF scintillator detector for neutron diffraction [PDF]
J Appl CrystallogrA novel high‐efficiency 2D position‐sensitive wavelength‐shifting‐fibre ZnS:Ag/6LiF scintillator detector has been developed at ISIS for single‐crystal diffraction applications. More than a factor of 3 improvement in efficiency was achieved with this detector compared with clear‐fibre scintillator detectors, and software routines for further ...
Mauri G +8 more
europepmc +2 more sources
Complexity, Volume 2025, Issue 1, 2025.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
ON THE SCHULTZ POLYNOMIAL AND HOSOYA POLYNOMIAL OF CIRCUMCORONENE SERIES OF BENZENOID [PDF]
Journal of applied mathematics & informatics, 2013 Let G = (V;E) be a simple connected graph. The sets of ver- tices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges rep- resent bonds. The distance between the vertices u and v in V (G) of graph G is the number of edges in a shortest path connecting them, we denote ...
openaire +1 more source
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.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
The higher-order matching polynomial of a graph
International Journal of Mathematics and Mathematical Sciences, 2005 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
Journal of Function Spaces, Volume 2025, Issue 1, 2025.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
Journal of Mathematics, Volume 2025, Issue 1, 2025.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
Hosoya-Wienerov polinom za utežene grafove [PDF]
, 2017 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
The Terminal Hosoya Polynomial of Some Families of Composite Graphs [PDF]
International Journal of Combinatorics, 2014 Let G be a connected graph and let Ω(G) be the set of pendent vertices of G. The terminal Hosoya polynomial of G is defined as TH(G,t)∶=∑x,y∈Ω(G):x≠ytdG(x,y), where dG(x,y) denotes the distance between the pendent vertices x and y. In this note paper we obtain closed formulae for the terminal Hosoya polynomial of rooted product graphs and corona ...
Deutsch, Emeric +1 more
openaire +2 more sources