Paper Info
Title
On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number
Abstract
The Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let Wn,k be the set of connected graphs with n vertices and clique number k. In this note we characterize the graphs from Wn,k with extremal (maximal and minimal) Hosoya indices and the ones with extremal (maximal and minimal) Merrifield–Simmons indices, respectively.
Year
DOI
Venue
2010
10.1016/j.aml.2009.11.005
Applied Mathematics Letters
Keywords
Field
DocType
Hosoya index,Merrifield–Simmons index,Clique number,Chromatic number
Discrete mathematics,Clique number,Combinatorics,Vertex (geometry),Vertex (graph theory),Hosoya index,Independent set,Connectivity,Mathematics,Clique (graph theory),Maximal independent set
Journal
Volume
Issue
ISSN
23
4
0893-9659
Citations 
PageRank 
References 
5
0.63
2
Authors
1
Name
Order
Citations
PageRank
Kexiang Xu17211.43