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

DOI10.1002/jgt.22185zbMath1391.05082OpenAlexW2752748329MaRDI QIDQ4575518

Alexander Stephens, Ortrud R. Oellermann

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22185

zbMATH Keywords

generating functions\(k\)-treeglobal mean orderslocal mean orderssimple-clique \(k\)-treessub-\(k\)-trees of \(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (6)

A lower bound on the average size of a connected vertex set of a graph ⋮ The average size of independent sets of graphs ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ The average size of a connected vertex set of a \(k\)-connected graph

This page was built for publication: The mean order of sub‐k‐trees of k‐trees