Let be a graph with n vertices and m edges. The sum of absolute value of all coefficients of matching polynomial is called Hosoya index. In this paper, we determine 2<sup>nd</sup> to 4<sup>th</sup...Let be a graph with n vertices and m edges. The sum of absolute value of all coefficients of matching polynomial is called Hosoya index. In this paper, we determine 2<sup>nd</sup> to 4<sup>th</sup> minimum Hosoya index of a kind of tetracyclic graph, with m = n +3.展开更多
Let G be a （molecular） graph. The Hosoya index Z（G） of G is defined as the number of subsets of the edge set E（G） in which no two edges are adjacent in G, i.e., Z（G） is the total number of matchings of G. In t...Let G be a （molecular） graph. The Hosoya index Z（G） of G is defined as the number of subsets of the edge set E（G） in which no two edges are adjacent in G, i.e., Z（G） is the total number of matchings of G. In this paper, we determine all the connected graphs G with n ＋ 1 ≤ Z（G） ≤5n - 17 for n ≥ 19. As a byproduct, the graphs of n vertices with Hosoya index from the second smallest value to the twenty first smallest value are obtained for n ≥ 19.展开更多
The Hosoya index of a graph is defined as the total number of the matching of the graph. In this paper, the ordering of polygonal chains with respect to Hosoya index is characterized.
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Ho- soya index of a graph is defined as the total number of the match- ings of the graph. In this pap...The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Ho- soya index of a graph is defined as the total number of the match- ings of the graph. In this paper, the definition of a class of po- lygonal chains is given, ordering of the polygonal chains with respect to Merrifield-Simmons index and Hosoya index are ob- tained, and their extremal graphs with respect to these two topo- logical indices are determined.展开更多
文摘Let be a graph with n vertices and m edges. The sum of absolute value of all coefficients of matching polynomial is called Hosoya index. In this paper, we determine 2<sup>nd</sup> to 4<sup>th</sup> minimum Hosoya index of a kind of tetracyclic graph, with m = n +3.
基金Supported by the National Natural Science Foundation of China(10761008, 10461009)the Science Foundation of the State Education Ministry of China(205170)
文摘Let G be a （molecular） graph. The Hosoya index Z（G） of G is defined as the number of subsets of the edge set E（G） in which no two edges are adjacent in G, i.e., Z（G） is the total number of matchings of G. In this paper, we determine all the connected graphs G with n ＋ 1 ≤ Z（G） ≤5n - 17 for n ≥ 19. As a byproduct, the graphs of n vertices with Hosoya index from the second smallest value to the twenty first smallest value are obtained for n ≥ 19.
基金Supported by the National Natural Science Foundation of China(10761008)the Scientific Research Foundation of the Education Department of Guangxi Province of China(201010LX471,201010LX495,201106LX595,201106LX608)the Natural Science Fund of Hechi University(2011YBZ-N003,2012YBZ-N004)
文摘The Hosoya index of a graph is defined as the total number of the matching of the graph. In this paper, the ordering of polygonal chains with respect to Hosoya index is characterized.
基金Supported by the National Natural Science Foundation of China(11161041)Innovative Team Subsidize of Northwest University for Nationalitiesthe Fundamental Research Funds for the Central Universities(31920140059)
文摘The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Ho- soya index of a graph is defined as the total number of the match- ings of the graph. In this paper, the definition of a class of po- lygonal chains is given, ordering of the polygonal chains with respect to Merrifield-Simmons index and Hosoya index are ob- tained, and their extremal graphs with respect to these two topo- logical indices are determined.
