caterpillar tree

In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path.

The central path can be viewed as the caterpillar's "body" and the other vertices can be viewed as its "feet".

A tree is a caterpillar if and only if it becomes a path when all of its leaves are removed. Here a leaf means a vertex of degree one in the original tree.

It can be proved that a diameter of a caterpillar is always its body.

posted @ 2020-05-15 17:14 Pat 阅读(248) 评论(0) 编辑收藏举报

会员力量，点亮园子希望

刷新页面返回顶部

Pat

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。

caterpillar tree

公告

Pat

「以解决问题为乐」 真的喜欢么？真的喜欢就去做吧。 Lost Boy Calling 。。。。 ... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code. This is an obscurity that catches the unwary. 原来我什么都不懂。

caterpillar tree

公告

「以解决问题为乐」

真的喜欢么？真的喜欢就去做吧。

Lost Boy Calling 。。。。

... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.

This is an obscurity that catches the unwary.

原来我什么都不懂。