Results 11 to 20 of about 1,818 (187)
The n-Hosoya Polynomials of the Composite of Some Special Graphs [PDF]
It is not easy to find the n-Hosoya polynomial of the compound graphs constructed in the form G1⊠G2 for any two disjoint connected graphs and .Therefore, in this paper, we obtain n-Hosoya polynomial of G1⊠G2 when is a complete graph and is a special ...
Ahmed Ali
doaj +4 more sources
n-Hosoya polynomials for Pentagonal Chains [PDF]
The diameter, with respect to the n-distance of the graph which represents a straight chain consisting of m pentagonal rings, is obtained in this paper. The n-Hosoya polynomial of , for all m and n, where , is also obtained.
Ali Ali, Hadeel Meshw
doaj +4 more sources
Hosoya Polynomials Of Some Semiconducotors
The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x = 1 is equal to the Wiener index and second derivative at x =1 is equal to the hyperï€Wiener index.
Azeez Lafta Jabir +2 more
doaj +2 more sources
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
doaj +2 more sources
Chromatic Schultz and Gutman Polynomials of Jahangir Graphs J2,m and J3,m
Topological polynomial and indices based on the distance between the vertices of a connected graph are widely used in the chemistry to establish relation between the structure and the properties of molecules.
Ramy Shaheen +2 more
doaj +2 more sources
Hosoya, Schultz, and Gutman Polynomials of Generalized Petersen Graphs Pn,1 and Pn,2
The graph theory has wide important applications in various other types of sciences. In chemical graph theory, we have many topological polynomials for a graph G through which we can compute many topological indices.
Ramy Shaheen +2 more
doaj +2 more sources
The Hosoya-Wiener Polynomial of Weighted Trees [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. Finally,
Blaž Zmazek, Janez Žerovnik
core +4 more sources
Graph of Orthogonal Idempotent Elements in Rings of Integers Modulo n With Spectral Clustering
The zero-divisor graph provides a relationship between abstract algebra and graph theory. Based on this concept, a new graph is defined using the orthogonal idempotent elements in a ring.
Shaimaa H. Ahmad +3 more
doaj +2 more sources
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 +1 more source
Results on Certain Biopolymers Using M-Polynomial and NM-Polynomial of Topological Indices. [PDF]
Topological indices are numerical descriptors that aid in the prediction of chemical molecules’ physiochemical properties and biological actions. It is often helpful to forecast numerous physiochemical attributes and biological actions of molecules in chemometrics, bioinformatics, and biomedicine.
Mohammed Yasin H +3 more
europepmc +2 more sources

