Counting shellings of complete bipartite graphs and trees
Name
10801_2020_965_ReferencePDF.pdf
Size
347.51 KB
Format
Adobe PDF
Checksum (MD5)
a232a08ea22383dc18043ea6d7f2671f
Author(s)
Gao, Yibo
Peng, Junyao
Date Issued
August 9, 2020
Publisher
Springer US
Version
Author's final manuscript
Abstract
Abstract
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite graphs and trees. For complete bipartite graphs, we obtain an exact formula for their shelling numbers. And for trees, we relate their shelling numbers to linear extensions of tree posets and bound shelling numbers using vertex degrees and diameter.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10801-020-00965-0
