GRAPHS WITH PRESCRIBED CONNECTIVITY AND LINE GRAPH CONNECTIVITY

被引：8

作者：

BAUER, D

TINDELL, R

机构：

来源：

JOURNAL OF GRAPH THEORY | 1979年 / 3卷 / 04期

关键词：

D O I：

10.1002/jgt.3190030410

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Chartrand and Stewart have shown that the line graph of an n‐connected graph is itself n‐connected. This paper shows that for every pair of integers m > n > 1 there is a graph of point connectivity n whose line graph has point connectivity m. The corresponding question for line connectivity is also resolved. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company

引用

页码：393 / 395

页数：3