getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

Valence connectivity versus Randic, Zagreb and modified Zagreb index: A linear algorithm to check discriminative properties of indices in acyclic molecular graphs

Post a Comment
CONTRIBUTORS:
  Author Damir VUKICEVIC
  Author Ante GRAOVAC
JOURNAL:
  Croatica chemica acta: Arhiv za kemiju, 77(3), 501 - 508.
YEAR: 2004
PUB TYPE: Journal Article
SUBJECT(S): chemistry - physical
DISCIPLINE: Chemistry
HTTP: http://lori.academicdirect.org/cites/33.pdf
LANGUAGE: English
PUB ID: 103-436-102 (Last edited on 2007/07/09 05:26:28 GMT-6)
SPONSOR(S):
 
ABSTRACT:
Valence connectivity in molecular graphs is described by 10- uples µij where µij denotes the number of edges connecting vertices of valences i and j. A shorter description is provided by 4-tuples containing the number of vertices and values of Randić, Zagreb and modified Zagreb indices. Surprisingly, these two descriptions are in one-to-one correspondence for all acyclic molecules of practical interest, i.e., for all those having no more than 100 atoms. This result was achieved by developing an efficient algorithm that is linear in the number of 10-tuples.
STATISTICS
Click on # to view
 Citations  
 References   1 
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/161 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2006 getCITED Inc. All Rights Reserved.