1986
DOI: 10.1007/978-3-642-70982-1
|View full text |Cite
|
Sign up to set email alerts
|

Mathematical Concepts in Organic Chemistry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
738
0
2

Year Published

1996
1996
2017
2017

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 1,010 publications
(744 citation statements)
references
References 0 publications
0
738
0
2
Order By: Relevance
“…Before this, we need to recall a few concepts from chemical graph theory. 12,13 Under "molecular graph" we understand a simple graph, representing the carbon-atom skeleton of an organic molecule (usually, of a hydrocarbon). Thus, the vertices of a molecular graph represent the carbon atoms, and its edges the carbon-carbon bonds.…”
Section: Introductionmentioning
confidence: 99%
“…Before this, we need to recall a few concepts from chemical graph theory. 12,13 Under "molecular graph" we understand a simple graph, representing the carbon-atom skeleton of an organic molecule (usually, of a hydrocarbon). Thus, the vertices of a molecular graph represent the carbon atoms, and its edges the carbon-carbon bonds.…”
Section: Introductionmentioning
confidence: 99%
“…Mathematical chemistry is a branch of theoretical chemistry using mathematical methods to discuss and predict molecular properties without necessarily referring to quantum mechanics [1,15,22]. Chemical graph theory is a branch of mathematical chemistry which applies graph theory in mathematical modeling of chemical phenomena [8].…”
Section: Introductionmentioning
confidence: 99%
“…The Merrifield-Simmons index and the Hosoya index of a graph, respectively introduced by Merrifield and Simmons [11,12,13] and by Hosoya [8], are two prominent examples of topological indices for the study of the relation between molecular structure and physical/chemical properties of certain hydrocarbon compound, such as the correlation with boiling points [5]. An independent set of vertices/edges of a graph G is a set of which no two vertices of the set are connected by a single edge.…”
Section: Introductionmentioning
confidence: 99%
“…For example, among trees with the same number of vertices, Prodinger and Tichy [17] proved that the star maximizes the Merrifield-Simmons index, while the path minimizes it. The situation for the Hosoya index is absolutely opposite; the star minimizes the Hosoya index, while the path maximizes it [5]. A good summary of results for extremal graphs of various types can be found in a survey paper [18].…”
Section: Introductionmentioning
confidence: 99%