The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs (Q1760722)

From MaRDI portal





scientific article; zbMATH DE number 6106237
Language Label Description Also known as
default for all languages
No label defined
    English
    The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs
    scientific article; zbMATH DE number 6106237

      Statements

      The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs (English)
      0 references
      0 references
      0 references
      15 November 2012
      0 references
      Summary: The Merrifield-Simmons index \(i(G)\) of a graph \(G\) is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, that is, the number of independent vertex sets of \(G\). The Hosoya index \(z(G)\) of a graph \(G\) is defined as the total number of independent edge subsets, that is, the total number of its matchings. By \(C(n,k,\lambda)\) we denote the set of graphs with \(n\) vertices, \(k\) cycles, the length of every cycle is \(\lambda\), and all the edges not on the cycles are pendant edges which are attached to the same vertex. In this paper, we investigate the Merrifield-Simmons index \(i(G)\) and the Hosoya index \(z(G)\) for a graph \(G\) in \(C(n,k,\lambda)\).
      0 references
      Merrifield-Simmons index
      0 references
      number of independent vertex sets
      0 references
      Hosoya index
      0 references
      number of matchings
      0 references

      Identifiers