Calculating the correlation coefficients of graph-theoretical indices
Stephan Wagner
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.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell