Results 151 to 160 of about 268,469 (172)
Some of the next articles are maybe not open access.

Hosoya polynomials of TUC4C8(S) nanotubes

Journal of Mathematical Chemistry, 2008
The Hosoya polynomial of a chemical graph G is \({H(G,x)=\sum\nolimits_{\{u, v\}\subseteq V(G)} x^{d_G(u, v)}}\) , where dG(u, v) denotes the distance between vertices u and v. In this paper, we obtain analytical expressions for Hosoya polynomials of TUC4C8(S) nanotubes. Accordingly, the Wiener index, obtained by Diudea et al. (MATCH Commun.
Heping Zhang, Shou-Jun Xu
exaly   +2 more sources

Hosoya polynomials and corresponding indices of aramids

International Journal of Geometric Methods in Modern Physics, 2023
Aramids are man-made high performance fibers admitting useful industrial applications. Aramids can be classified into para-aramids and meta-aramids. Kevlar is a para-aramid and Nomex is a meta-aramid. This work is devoted to compute the empirical formula for the Hosoya polynomial of these aramids.
Sidra Rashid   +3 more
openaire   +2 more sources

The Edge-Hosoya Polynomial of Catacondensed Benzenoid Graphs Associated with its Hosoya Polynomial

Match Communications in Mathematical and in Computer Chemistry
This paper reveals the relationship between edge-Hosoya polynomial and the Hosoya polynomial of catacondensed benzenoid graphs. The result shows that, for a catacondensed benzenoid graph, the computations of the edge-Hosoya polynomial can be reduced to that of the Hosoya polynomial.
Li, Wei, Chen, Ailian, Wu, Jiali
openaire   +1 more source

Hosoya polynomial of some cactus chains

open access: yesCogent Mathematics, 2017
Let G=(V,E) be a simple graph. Hosoya polynomial of G is H(G,x)=∑{u,v}⊆V(G)xd(u,v), where d(u, v) denotes the distance between vertices u and v.
Saeid Alikhani   +2 more
exaly   +2 more sources

Generalized Hosoya polynomials of hexagonal chains

Journal of Mathematical Chemistry, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Shou-Jun Xu
exaly   +2 more sources

The Hosoya Polynomial of One-Pentagonal Carbon Nanocone

Fullerenes Nanotubes and Carbon Nanostructures, 2014
Let G be a chemical graph with vertex set V(G) and the distance between vertices u and v in G. The Hosoya polynomial in variable x of graph G is . In this article, we give an analytical expression for calculating the Hosoya polynomial of one-pentagonal carbon nanocone. Furthermore, a series of distance-based molecular structure descriptors, such as the
Shou-Jun Xu
exaly   +2 more sources

The Hosoya Polynomial of One-Heptagonal Nanocone

Current Nanoscience, 2013
For a molecular graph G with vertex set V (G) , we denote by dG (u,v ) the distance between vertices u and v in G ...
Shou-Jun Xu, Qiu-Xia Zhang
openaire   +1 more source

Reliability Hosoya-Wiener Polynomial of Double Weighted Trees

Fundamenta Informaticae, 2016
Reliability Hosoya-Wiener polynomial for edge weighted graphs is defined, that can be used as a measure of reliability of a communication network. Each edge is assigned two weights, reliability and communication delay. Some basic properties are given and a recursive formula for the reliability Hosoya-Wiener polynomial of a rooted ...
Darja Rupnik Poklukar, Janez Zerovnik
openaire   +2 more sources

Relationship between the Hosoya polynomial and the hyper-Wiener index

open access: yesApplied Mathematics Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

On the roots of Hosoya polynomial of a graph

2013
Let G = (V, E) be a simple graph. Hosoya polynomial of G is ) v , u ( d ) G ( V } v , u { x = ) x , G ( H   , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph.
REYHANI, M.   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy