arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04247math.CO
收藏

关于路对图的最大直径

On the maximum diameter of path-pairable graphs

Antonio Girao, Gabor Meszaros, Kamil Popielarz, Richard Snyder

摘要:

一个图是路可配对的,如果对于它的任何顶点对,存在连接每对顶点的边不交路。我们得到了清晰的界限上的最大可能直径的路径配对图,要么有一个给定的边数,或c-退化。一路上,我们表明,一个大家庭的图通过炸毁一个路径是路径可配对的,这可能是独立的利益。

英文摘要:

A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are c- degenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑