论文信息 - The mean order of sub‐k‐trees of k‐trees - 字舞流文

The mean order of sub‐k‐trees of k‐trees

Ortrud R. Oellermann | Alexander M. Stephens | O. Oellermann | Alexander M. Stephens

[1] Robert E. Jamison,et al. On the average number of nodes in a subtree of a tree , 1983, J. Comb. Theory, Ser. B.

[2] John Haslegrave,et al. Extremal results on average subtree density of series-reduced trees , 2013, J. Comb. Theory, Ser. B.

[3] Ralf Fröberg,et al. A characterization of k-trees , 1992, Discret. Math..

[4] R. E. Pippert,et al. Properties and characterizations of k -trees , 1971 .

[5] R. Jamison,et al. Alternating whitney sums and matchings in trees. I , 1987 .

[6] Hua Wang,et al. Indistinguishable Trees and Graphs , 2014, Graphs Comb..

[7] Robert E. Jamison,et al. Monotonicity of the mean order of subtrees , 1984, J. Comb. Theory, Ser. B.

[8] Lilian Markenzon,et al. Subclasses of k-trees: Characterization and recognition , 2006, Discret. Appl. Math..

[9] Donald J. ROSE,et al. On simple characterizations of k-trees , 1974, Discret. Math..

[10] G. Ziegler,et al. Inscribable stacked polytopes , 2011, 1111.5322.

[11] Hua Wang,et al. The average order of a subtree of a tree , 2010, J. Comb. Theory, Ser. B.

[12] Andrzej Proskurowski,et al. Separating subgraphs in k-trees: Cables and caterpillars , 1984, Discret. Math..

[13] Hua Wang,et al. On the Local and Global Means of Subtree Orders , 2016, J. Graph Theory.