Some Bounds for the Connectivity Index of a Chemical Graph

Autor:	J. A. de la Peña, Oswaldo Araujo
Rok vydání:	1998
Předmět:	Discrete mathematics Voltage graph General Chemistry Butterfly graph Computer Science Applications law.invention Combinatorics Computational Theory and Mathematics Graph power law Line graph Cubic graph Regular graph Null graph Complement graph Information Systems Mathematics
Zdroj:	Journal of Chemical Information and Computer Sciences. 38:827-831
ISSN:	0095-2338
Popis:	Let G be a simple graph. We say that G is a chemical graph if G is connected and the degree di ≤ 4 for every vertex i. We consider the connectivity index 1χ(G) of a chemical graph G. We use some graph theoretic constructions to find bounds for 1χ(G) which depend only on the number of vertices, the ramification index, and the cyclomatic number of the graph G. The results are related to the problem of graph reconstruction from a collection of graph invariants.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::610a773978eae199d2e29cece443298e https://doi.org/10.1021/ci980012s Zobrazit plný text záznamu