论文标题

具有最多四个边界顶点的图表的表征

A characterization of graphs with at most four boundary vertices

论文作者

Chiem, Nick, Dudarov, William, Lee, Chris, Lee, Sean, Liu, Kevin

论文摘要

Steinerberger定义了图形的边界概念,并建立了相应的等值询问。因此,“大”图具有更多的边界顶点。在本文中,我们首先用两个无限的图表来表征三个边界顶点的图。然后,我们用八个图形族的八个属于无限的图形来完全表征具有四个边界顶点的图形。这与谷川和锡托的早期作品以及Müller,Pór和Sereni的作品相似,在Chartrand,Erwin,Johns和Zhang定义的另一个边界概念上。

Steinerberger defined a notion of boundary for a graph and established a corresponding isoperimetric inquality. Hence, "large" graphs have more boundary vertices. In this paper, we first characterize graphs with three boundary vertices in terms of two infinite families of graphs. We then completely characterize graphs with four boundary vertices in terms of eight families of graphs, five of which are infinite. This parallels earlier work by Hasegawa and Saito as well as Müller, Pór, and Sereni on another notion of boundary defined by Chartrand, Erwin, Johns, and Zhang.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源