论文信息 - On the ordering of graphs with respect to their matching numbers - 字舞流文

On the ordering of graphs with respect to their matching numbers

Abstract The number of k-matchings in a graph G is denoted by m(G,k). If for two graphs G1 and G2, m(G1, k) ≥m(G2,k) for all k, then we write G1 > G2. Six classes of graphs are ordered with respect to the relation >.

Fuji Zhang | Ivan Gutman

[1] Haruo Hosoya,et al. Topological Index and Thermodynamic Properties. III. Classification of Various Topological Aspects of Properties of Acyclic Saturated Hydrocarbons , 1985 .

[2] Haruo Hosoya,et al. Topological Index and Thermodynamic Properties. I. Empirical Rules on the Boiling Point of Saturated Hydrocarbons , 1972 .

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

[4] I. Gutman,et al. On the theory of the matching polynomial , 1981, J. Graph Theory.

[5] Ivan Gutman. The Acyclic Polynomial Of A Graph , 1977 .

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

[7] Haruo Hosoya,et al. Topological Index and Thermodynamic Properties. II. Analysis of the Topological Factors on the Absolute Entropy of Acyclic Saturated Hydrocarbons , 1980 .

[8] E. J. Farrell,et al. An introduction to matching polynomials , 1979, J. Comb. Theory, Ser. B.

[9] Ivan Gutman. Acyclic systems with extremal Hückel π-electron energy , 1977 .

[10] J. Aihara. A new definition of Dewar-type resonance energies , 1976 .

[11] I. Gutman,et al. Graph theory and molecular orbitals. 19. Nonparametric resonance energies of arbitrary conjugated systems , 1977 .