论文信息 - Sharp bounds for the number of matchings in generalized-theta-graphs

Sharp bounds for the number of matchings in generalized-theta-graphs

A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) internally disjoint paths. We denote the family of all the n-vertex generalized-theta-graphs with k paths between end vertices by � n . In this paper, we determine the sharp lower bound and the sharp upper

Ardeshir Dolati | Somayyeh Golalizadeh

[1] Hanyuan Deng,et al. The extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index , 2008 .

[2] Haixing Zhao. ON THE FIBONACCI NUMBERS OF TREES , 2009 .

[3] Hongbo Hua. Minimizing a class of unicyclic graphs by means of Hosoya index , 2008, Math. Comput. Model..

[4] Tomislav Doslic,et al. Chain hexagonal cacti: Matchings and independent sets , 2010, Discret. Math..

[5] Hanyuan Deng. The largest Hosoya index of (n, n+1)-graphs , 2008, Comput. Math. Appl..

[6] Apostolos Syropoulos,et al. Mathematics of Multisets , 2000, WMP.

[7] I. Gutman,et al. Mathematical Concepts in Organic Chemistry , 1986 .

[8] Kexiang Xu. On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number , 2010, Appl. Math. Lett..

[9] Harold Ellsworth Tinnappel. On the topological index , 1952 .

[10] Jianping Ou. On extremal unicyclic molecular graphs with maximal Hosoya index , 2009, Discret. Appl. Math..

[11] H. Hosoya. Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons , 1971 .