Short Proofs on The Connectivity of Graph

CNU IR > Chna Nan Annual Bulletin > Vol.24 (1998) > Item 310902800/22763

Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/22763

Title:	Short Proofs on The Connectivity of Graph 連通圖形的簡潔理論證明
Authors:	Wen-Sz Chiue Bih-Sheue Shieh Sheng-Kia Yang
Contributors:	化妝品應用與管理學系資訊管理學系
Keywords:	Soft packaging materials Infrared spectrophotometer Differential scanning calorime- try Mechanical behavior 路徑圓圈點連通
Date:	1998
Issue Date:	2010-05-11 14:09:34 (UTC+8)
Abstract:	In this,we give two new and simple proofs relative to the connected graph.The relation-ship of connectivity and disjoint paths of any two points will be discussed,then a necessary condi-tion of n-connected graph presents next. 網路架構的理論根據是圖論，尤其是連通圖形的部分，因此對於連通圖形的一些經典定理的研讀是必須的，本篇論文是原來複雜且難懂的兩個關係連通圖形重要的定理證明，從另一觀點，用數學歸納法提出簡潔有力的另一證明方式以供比較。
Relation:	嘉南學報 24期 : p.133-136
Appears in Collections:	[Chna Nan Annual Bulletin] Vol.24 (1998) [Dept. of Cosmetic Science and institute of cosmetic science] Periodical Articles [Dept. of Information Management] Periodical Articles

Files in This Item:

There are no files associated with this item.