On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution

The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction. Motivated from the study of graph surgeries on evolutionary dynamics, we consider the subtree p...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2019-05, Vol.7 (5), p.472
Main Authors: Yang, Yu, Wang, An, Wang, Hua, Zhao, Wei-Ting, Sun, Dao-Qiang
Format: Article
Language:English
Subjects:
Algorithms
Enumeration
Evolution
fan graph
generating function
Graphs
Mathematics
Network management systems
Network topologies
subtree
wheel graph
“partitions” of wheel graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction. Motivated from the study of graph surgeries on evolutionary dynamics, we consider the subtree problems of fan graphs, wheel graphs, and the class of graphs obtained from “partitioning” wheel graphs under dynamic evolution. The enumeration of these subtree numbers is done through the so-called subtree generation functions of graphs. With the enumerative result, we briefly explore the extremal problems in the corresponding class of graphs. Some interesting observations on the behavior of the subtree number are also presented.
ISSN:2227-7390
2227-7390
DOI:10.3390/math7050472