Results 151 to 160 of about 9,542 (190)

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

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

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, Amudha, B B, Srınıvasa, Rao   +2 more
openaire   +2 more sources

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

The smallest Hosoya index in (n, n + 1)-graphs

Journal of Mathematical Chemistry, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number

Numerical Methods for Partial Differential Equations, 2020
AbstractThe Hosoya index and the Merrifield‐Simmons index are two important molecular descriptors in chemical graph theory. The Hosoya index is defined as the total number of matchings of the graph and the Merrifield‐Simmons index is defined as the total number of independent sets of the graph.
openaire   +1 more source

Wiener−Hosoya Index A Novel Graph Theoretical Molecular Descriptor

Journal of Chemical Information and Computer Sciences, 2004
We describe the construction of a novel molecular descriptor, called the Wiener-Hosoya index, in view of its structural relationship to both the Wiener number W and the Hosoya topological index Z. It is shown that this index has a smaller degeneracy than many simple topological indices, including W, Z, and the connectivity index chi. In a way the index
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, JING ZHAO, JIE MIN, JINDE CAO   +3 more
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, Ali Iranmanesh, Samaneh Hossein–Zadeh, Mohammad Ali Hosseinzadeh   +3 more
openaire   +1 more source

Hosoya index of bridge and splice graphs

2012
The Hosoya index of a graph is defined as the total number of the matchings (including the empty edge set) of the graph. In this paper, explicit formulas are given for the Hosoya index of bridge and splice graphs.
openaire   +1 more source