Calculating the correlation coefficients of graph-theoretical indices

2006/08/30 by Stephan Wagner, Wagner, Stephan
Mathematics · #05A16 (Primary) #05C30 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A16 #msc:05C30

paper · pdf · doi:10.48550/arxiv.math/0608753

16 pages; for associated Mathematica files, see http://finanz.math.tugraz.at/~wagner/Correlation

arxiv created 2006/08/30 · arxiv updated 2009/12/01

Abstract

Using a generating function approach, the correlation coefficients of four different graph-theoretical indices, namely the number of independent vertex subsets, the number of matchings, the number of subtrees and the Wiener index, are asymptotically determined for random rooted ordered trees.

Related

• Testing network correlation efficiently via counting trees
• Pearson's correlation coefficient in the theory of networks: A comment
• The Covariance of Topological Indices that Depend on the Degree of a Vertex
• Wiener index, number of subtrees, and tree eccentric sequence
• On Random Graph Properties