Some bounds for the connectivity index of a chemical graph

Let G be a simple graph. We say that G is a chemical graph if G is connected and the degree d(i) less than or equal to 4 for every vertex i. We consider the connectivity index (1)chi(G) of a chemical graph G. We use some graph theoretic constructions to find bounds for (1)chi X(G) which depend only...

Descripción completa

Detalles Bibliográficos
Autores: Araujo, O, De la Pena, JA
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:1998
País:México
Institución:Universidad Nacional Autónoma de México
Repositorio:Sistema de Información de la Facultad de Ciencias, UNAM
OAI Identifier:oai:repositorio.fciencias.unam.mx:11154/2754
Acceso en línea:http://hdl.handle.net/11154/2754
Access Level:acceso abierto
Palabra clave:Chemistry, Multidisciplinary
Computer Science, Information Systems
Computer Science, Interdisciplinary Applications
id MX_78f6b376c24d28a48986889e715e3fe4
oai_identifier_str oai:repositorio.fciencias.unam.mx:11154/2754
network_acronym_str MX
network_name_str México
repository_id_str
spelling Some bounds for the connectivity index of a chemical graphAraujo, ODe la Pena, JAChemistry, MultidisciplinaryComputer Science, Information SystemsComputer Science, Interdisciplinary ApplicationsLet G be a simple graph. We say that G is a chemical graph if G is connected and the degree d(i) less than or equal to 4 for every vertex i. We consider the connectivity index (1)chi(G) of a chemical graph G. We use some graph theoretic constructions to find bounds for (1)chi X(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.2011-01-22T10:27:47Z2011-01-22T10:27:47Z1998info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article0095-2338http://hdl.handle.net/11154/2754280638(5):827-831reponame:Sistema de Información de la Facultad de Ciencias, UNAMinstname:Universidad Nacional Autónoma de Méxicoinstacron:UNAMenJournal of Chemical Information and Computer Sciencesinfo:eu-repo/semantics/openAccessoai:repositorio.fciencias.unam.mx:11154/27542025-09-17T19:21:16Z
dc.title.none.fl_str_mv Some bounds for the connectivity index of a chemical graph
title Some bounds for the connectivity index of a chemical graph
spellingShingle Some bounds for the connectivity index of a chemical graph
Araujo, O
Chemistry, Multidisciplinary
Computer Science, Information Systems
Computer Science, Interdisciplinary Applications
title_short Some bounds for the connectivity index of a chemical graph
title_full Some bounds for the connectivity index of a chemical graph
title_fullStr Some bounds for the connectivity index of a chemical graph
title_full_unstemmed Some bounds for the connectivity index of a chemical graph
title_sort Some bounds for the connectivity index of a chemical graph
dc.creator.none.fl_str_mv Araujo, O
De la Pena, JA
author Araujo, O
author_facet Araujo, O
De la Pena, JA
author_role author
author2 De la Pena, JA
author2_role author
dc.subject.none.fl_str_mv Chemistry, Multidisciplinary
Computer Science, Information Systems
Computer Science, Interdisciplinary Applications
topic Chemistry, Multidisciplinary
Computer Science, Information Systems
Computer Science, Interdisciplinary Applications
description Let G be a simple graph. We say that G is a chemical graph if G is connected and the degree d(i) less than or equal to 4 for every vertex i. We consider the connectivity index (1)chi(G) of a chemical graph G. We use some graph theoretic constructions to find bounds for (1)chi X(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.
publishDate 1998
dc.date.none.fl_str_mv 1998
2011-01-22T10:27:47Z
2011-01-22T10:27:47Z
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv 0095-2338
http://hdl.handle.net/11154/2754
2806
identifier_str_mv 0095-2338
2806
url http://hdl.handle.net/11154/2754
dc.language.none.fl_str_mv en
language_invalid_str_mv en
dc.relation.none.fl_str_mv Journal of Chemical Information and Computer Sciences
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv 38(5):827-831
reponame:Sistema de Información de la Facultad de Ciencias, UNAM
instname:Universidad Nacional Autónoma de México
instacron:UNAM
instname_str Universidad Nacional Autónoma de México
instacron_str UNAM
institution UNAM
reponame_str Sistema de Información de la Facultad de Ciencias, UNAM
collection Sistema de Información de la Facultad de Ciencias, UNAM
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1858175791734456320
score 15,812455

Similares en LA Referencia