Subtrees of graphs

DOI10.1002/JGT.22359zbMATH Open1440.05076DBLPjournals/jgt/ChinGMV18OpenAlexW2800651034WikidataQ60691706 ScholiaQ60691706MaRDI QIDQ4646947FDOQ4646947

Authors: Alex J. Chin, Gary Gordon, Kellie J. MacPhee, Charles Vincent 

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

Recommendations

• On the number of subtrees for almost all graphs
• The mean order of sub-\(k\)-trees of \(k\)-trees
• scientific article; zbMATH DE number 3849285
• Random trees in a graph and trees in a random graph
• The number of subtrees in graphs with given number of cut edges

zbMATH Keywords

subtreestheta graphs

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cited In (26)

• The number and average size of connected sets in graphs with degree constraints
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Decreasing the mean subtree order by adding k edges
• The path minimises the average size of a connected induced subgraph
• On the probability that a random subtree is spanning
• The mean order of sub-\(k\)-trees of \(k\)-trees
• Subgroup-chain graphs
• Title not available (Why is that?)
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• Solution to a conjecture on the mean subtree order of graphs under edge addition
• Random subtrees and unimodal sequences in graphs
• On subtree number index of generalized book graphs, fan graphs, and wheel graphs
• On the mean order of connected induced subgraphs of block graphs
• The expected subtree number index in random polyphenylene and spiro chains
• The average size of ordered binary subgraphs
• Fully leafed induced subtrees
• Models of random subtrees of a graph
• Enumeration of subtrees of planar two-tree networks
• The sparse sequences of graphs
• A tight upper bound on the average order of dominating sets of a graph
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• On the mean subtree order of graphs under edge addition
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• Computing the number and average size of connected sets in planar 3-trees

This page was built for publication: Subtrees of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646947)