Results 21 to 30 of about 13,778,255 (132)
Structural Differentiation of Graphs Using Hosoya-Based Indices [PDF]
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which
Dehmer, Matthias +2 more
core +3 more sources
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
Adnan Aslam +5 more
core +1 more source
Hosoya polynomial, Wiener and Hyper-Wiener indices of some regular graphs
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is ...
Mohammad Reza Farahani
core +1 more source
The largest Hosoya index of (n,n+1)-graphs [PDF]
The Hosoya index of a graph is defined as the total number of its matchings. In this paper, we obtain that the largest Hosoya index of (n,n+1)-graphs is f(n+1)+f(n−1)+2f(n−3), where f(n) is the nth Fibonacci number, and we characterize the extremal ...
Deng, Hanyuan
core +1 more source
Quantitative structure–property relationship (QSPR) models generate a mathematical formalism describing the molecular structure with the help of physical and chemical properties of compounds. In the present work, we are reporting an investigation on a set of neighborhood degree‐based topological indices for QSPR studies of some antibiotic drugs such as
Fengwei Li +5 more
wiley +1 more source
Detour Hosoya Polynomials of Some Compound Graphs [PDF]
In this paper we will introduce a new graph distance based polynomial; Detour Hosoya polynomials of graphs . The Detour Hosoya polynomials for some special graphs such as paths and cycles are obtained.
Herish Abdullah, Gashaw Muhammed-Saleh
core +1 more source
Construction of Graphs and Zero‐Divisor Graphs by Degree‐Joint Operations of Graphs
The new construction of graphs obtained by degree‐joint operations between maximum‐degree and minimum‐degree of some types of graphs with different vertex and edge sets denoted by Gδ, GΔ respectively, joins vertices of maximum (minimum) degree in one graph with those of the same type in the other graph of the second graph, where the degree‐joint ...
Mohammed N. Authman +3 more
wiley +1 more source
Hosoya Polynomials of Hexagonal Chains
Topological indices are used in mathematically modeling graphs and have applications in chemistry, where they can be used to relate structures of molecular compounds to their properties.The Hosoya polynomial can be used to determine distance-based ...
Scheinbaum, Jessica
core +1 more source
Topological Aspects of Quadratic Graphs and M‐Polynomials Utilizing Classes of Finite Quasigroups
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
Hosoya polynomial of the subdivided join [PDF]
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
core

