Results 161 to 170 of about 3,633,781 (192)
Some of the next articles are maybe not open access.

On the Hosoya index of graphs

Applied Mathematics-A Journal of Chinese Universities, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Bo, Ye, Chengfu, Yan, Liying
openaire   +2 more sources

THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH

Fractals, 2019
The computational complexity of the Hosoya index of a given graph is NP-Complete. Let [Formula: see text] be the graph constructed from [Formula: see text] by a triangle instead of all vertices of the initial graph [Formula: see text]. In this paper, we characterize the Hosoya index of the graph [Formula: see text].
JIA-BAO LIU   +3 more
openaire   +1 more source

Hosoya Index of Splices, Bridges, and Necklaces

2016
The Hosoya index Z(G) of a graph G is the total number of matchings in G. We present explicit formulas for the Hosoya indices of several classes of graphs that arise from simpler graphs by repeating application of two simple operations.
Tomislav Došlić, Reza Sharafdini
openaire   +2 more sources

Orderings of a class of trees with respect to the Merrifield–Simmons index and the Hosoya index

Journal of Combinatorial Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenwen Tian   +4 more
openaire   +2 more sources

An efficient Hosoya index algorithm and its application

International Journal of Computer Aided Engineering and Technology, 2019
The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as
openaire   +1 more source

The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures

2016
The Hosoya index and the Merrifield–Simmons index are two types of graph invariants used in mathematical chemistry. In this chapter, we give ex act formulas for the Hosoya index and the Merrifield–Simmons index of bridge graph and as an application of these formulas, we obtain these indices for some nano structures.
Asma Hamzeh   +3 more
openaire   +1 more source

Hosoya polynomial and Wiener index of concatenated octachains

2020
Summary: Wiener index of a connected graph \(G=(V,E)\) is defined as \(W(G)=\sum_{\{u,v\}\subset V(G)}d(u,v)\) and Hosoya polynomial is defined as \(H(G,x)=\sum_{\{u,v\}\subset V(G)}x^{d(u,v)}\). In this paper, Wiener index and Hosoya polynomials of several types of graphs consisting of concatenated octagon rings which are used in chemistry ...
Cangül, İsmail Naci   +2 more
openaire   +2 more sources

An optimization of the procedure for the calculation of Hosoya's index

Journal of Mathematical Chemistry, 1991
An optimized procedure for the calculation of Hosoya's topological index is presented. The procedure has been implemented in PASCAL. The described procedure could be simply modified for calculations of different modifications of Hosoya's index and Merrifield-Simmon's index. As an example, four useful modifications of Hosoya's index are defined.
openaire   +1 more source

Hosoya index and Fibonacci numbers

2011
Let G =(V ,E) be a simple graph. The Hosoya index Z(G) of G is defined as the total number of edge independent sets of G . Fibonacci numbers are terms of the sequence defined in a quite simple recursive fashion. In this paper, we investigate the relationships between Hosoya index and Fibonacci numbers. Also we consider Fibonacci cubes and study some of
openaire   +1 more source

Ordering polygonal chains with respect to Hosoya index

Applied Mathematics-A Journal of Chinese Universities, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiao, Youfu, Zhan, Fuqin
openaire   +2 more sources

Home - About - Disclaimer - Privacy