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.

中文翻译：

---

计算完整二部图和树的炮击

图的脱壳，被视为抽象的单纯复形，其维数为1，是其边缘的排序，使得每个边缘都与先前出现的其他一些边缘相邻。在本文中，我们专注于完整的二部图和树。对于完整的二部图，我们获得了其脱壳数的精确公式。对于树木，我们使用顶点度和直径将它们的脱壳数与树的波状体的线性扩展和绑定的脱壳数相关联。