A SIMPLE PROOF OF WHITNEY'S THEOREM ON CONNECTIVITY IN GRAPHS
被引:0
|
作者:
Zhao, Kewen
论文数: 0引用数: 0
h-index: 0
机构:
Moorhead State Univ, Dept Comp Sci & Informat Syst, Moorhead, MN 56563 USAMoorhead State Univ, Dept Comp Sci & Informat Syst, Moorhead, MN 56563 USA
Zhao, Kewen
[1
]
机构:
[1] Moorhead State Univ, Dept Comp Sci & Informat Syst, Moorhead, MN 56563 USA
来源:
MATHEMATICA BOHEMICA
|
2011年
/
136卷
/
01期
关键词:
connectivity;
graph;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In 1932 Whitney showed that a graph G with order n >= 3 is 2-connected if and only if any two vertices of G are connected by at least two internally -disjoint paths. The above result and its proof have been used in some Graph Theory books, such as in Bondy and Murty's well-known Graph Theory with Applications. In this note we give a much simple proof of Whitney's Theorem.
机构:
St Petersburg State Univ, Lab Modern Algebra & Applicat, 14th Line,29b, St Petersburg 199178, RussiaSt Petersburg State Univ, Lab Modern Algebra & Applicat, 14th Line,29b, St Petersburg 199178, Russia
Ivanov, Sergei O.
Romanovskii, Vladislav
论文数: 0引用数: 0
h-index: 0
机构:
St Petersburg State Univ, Lab Modern Algebra & Applicat, 14th Line,29b, St Petersburg 199178, RussiaSt Petersburg State Univ, Lab Modern Algebra & Applicat, 14th Line,29b, St Petersburg 199178, Russia
Romanovskii, Vladislav
Semenov, Andrei
论文数: 0引用数: 0
h-index: 0
机构:
St Petersburg State Univ, Chebyshev Lab, 14th Line,29b, St Petersburg 199178, RussiaSt Petersburg State Univ, Lab Modern Algebra & Applicat, 14th Line,29b, St Petersburg 199178, Russia