
























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。