Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Discrete Math. 21, pp. 33-46 (14 pages)
Correlation of Graph‐Theoretical Indices
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookThe correlation of graph characteristics, such as the number of independent vertex or edge subsets, the number of connected subsets, or the sum of distances, which also play a role in combinatorial chemistry, is studied by a generating function approach and asymptotic analysis. It is shown how an asymptotic formula for the correlation coefficient can be obtained when simply generated families of trees are investigated. For rooted ordered trees, the calculations are done explicitly. Further feasible correlation measures are discussed.
© 2007 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received May 12, 2005
Accepted September 05, 2006
Published online January 12, 2007
Accepted September 05, 2006
Published online January 12, 2007
Digital Object Identifier
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar