Subtrees of graphs
From MaRDI portal
Publication:4646947
DOI10.1002/jgt.22359zbMath1440.05076OpenAlexW2800651034WikidataQ60691706 ScholiaQ60691706MaRDI QIDQ4646947
Gary Gordon, Charles Vincent, Kellie J. MacPhee, Alex J. Chin
Publication date: 3 January 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22359
Related Items (18)
Enumeration of subtrees of planar two-tree networks ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ On the mean subtree order of graphs under edge addition ⋮ On the probability that a random subtree is spanning ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Random subtrees and unimodal sequences in graphs ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Solution to a conjecture on the mean subtree order of graphs under edge addition ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ Decreasing the mean subtree order by adding k edges ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ Models of random subtrees of a graph ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ On subtree number index of generalized book graphs, fan graphs, and wheel graphs ⋮ The path minimises the average size of a connected induced subgraph
This page was built for publication: Subtrees of graphs
