On the Hosoya index for the molecular graphs of helicenes
On the Hosoya index for the molecular graphs of helicenes
The matching of an undirected graph G=(V,E) is a subset M of E such that no two edges of M are adjacent in G. The Hosoya index of a graph G is given by the number of all matching of G . This number is one of the most interesting topological index in chemistry. Helicenes are extremal hexagonal chains with a simple graph representation as an important subclass of benzenoid molecules. We obtain the exact formula for the Hosoya index of the molecular graphs of helicenes as a function of the number of hexagons in them.
- University of Pardubice Czech Republic
difference equation, diferenční rovnice, molecular graph, molekulární graf, dekompoziční věta, Hosoyův index, decomposition theorem, Párování v grafu, Matching of a graph, Hosoya index, helicene, helicen
difference equation, diferenční rovnice, molecular graph, molekulární graf, dekompoziční věta, Hosoyův index, decomposition theorem, Párování v grafu, Matching of a graph, Hosoya index, helicene, helicen
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!