2010
DOI: 10.1007/s10440-010-9575-5
|View full text |Cite
|
Sign up to set email alerts
|

Maxima and Minima of the Hosoya Index and the Merrifield-Simmons Index

Abstract: The Hosoya index and the Merrifield-Simmons index are typical examples of graph invariants used in mathematical chemistry for quantifying relevant details of molecular structure. In recent years, quite a lot of work has been done on the extremal problem for these two indices, i.e., the problem of determining the graphs within certain prescribed classes that maximize or minimize the index value. This survey collects and classifies these results, and also provides some useful auxiliary results, tools and techniq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
53
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 115 publications
(54 citation statements)
references
References 74 publications
1
53
0
Order By: Relevance
“…The numbers of the Fibonacci type play an important role in distinct areas of mathematics and they have many different applications and interpretations. Some of them are closely related to the Hosoya index ( ) (defined as a number of all matchings in the graph , including the empty matching) and the Merrifield-Simmons index ( ) (defined as a number of all independent sets in , including the empty set); see [2] and its references. It is well-known that (P ) = and (P ∘ K 1 ) = +1 , for ≥ 1, where P is an -vertex path, K is an -vertex complete graph, and ∘ denotes the corona of two graphs.…”
Section: Introduction and Preliminary Resultsmentioning
confidence: 99%
“…The numbers of the Fibonacci type play an important role in distinct areas of mathematics and they have many different applications and interpretations. Some of them are closely related to the Hosoya index ( ) (defined as a number of all matchings in the graph , including the empty matching) and the Merrifield-Simmons index ( ) (defined as a number of all independent sets in , including the empty set); see [2] and its references. It is well-known that (P ) = and (P ∘ K 1 ) = +1 , for ≥ 1, where P is an -vertex path, K is an -vertex complete graph, and ∘ denotes the corona of two graphs.…”
Section: Introduction and Preliminary Resultsmentioning
confidence: 99%
“…More extreme results on these two indices for other class of graphs can be found in the survey [18]. In order to prove our theorems, we need a simple lemma which follows directly from the definitions.…”
Section: Then Z (G) Is Maximized By Such a Graph G That G C Is A Disjmentioning
confidence: 99%
“…For other results related to the parameter NI( ) and their applications, see the last survey [7]. In this survey the authors collect and classify the results concerning the graph parameter NI( ), most of which are obtained quite recently.…”
Section: Journal Of Applied Mathematics (H) Perrin Numbers Pr( )mentioning
confidence: 99%