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

From MaRDI portal
Created claim: Wikidata QID (P12): Q58906054, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A theorem of Littlewood, Orlicz, and Grothendieck about sums in \(L^1(0,1)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of matchings and independent sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ordering of graphs with respect to their matching numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic systems with minimal Hosoya index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest Hosoya index of \((n,n+1)\)-graphs / rank
 
Normal rank

Revision as of 20:37, 5 July 2024

scientific article
Language Label Description Also known as
English
The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs
scientific article

    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