scholarly journals A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees

2017 ◽  
Vol 232 ◽  
pp. 230-234 ◽  
Author(s):  
Chuanqi Xiao ◽  
Haiyan Chen ◽  
Andrei M. Raigorodskii
2003 ◽  
Vol 43 (2) ◽  
pp. 609-614 ◽  
Author(s):  
István Lukovits ◽  
Ante Graovac ◽  
Erika Kálmán ◽  
György Kaptay ◽  
Péter Nagy ◽  
...  
Keyword(s):  

1986 ◽  
Vol 125 (3) ◽  
pp. 218-220 ◽  
Author(s):  
John L. Bergan ◽  
Sven J. Cyvin ◽  
Bjorg N. Cyvin

Author(s):  
S. J. Cyvin ◽  
J. Brunvoll ◽  
B. N. Cyvin ◽  
R. S. Chen ◽  
F. J. Zhang
Keyword(s):  

Fractals ◽  
2019 ◽  
Vol 27 (08) ◽  
pp. 1950135 ◽  
Author(s):  
JIA-BAO LIU ◽  
JING ZHAO ◽  
JIE MIN ◽  
JINDE CAO

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]. To our surprise, it shows that the Hosoya index of [Formula: see text] is thoroughly given by the order and degrees of all the vertices of the initial graph [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document