On the Minimum Diameter among Orientations of CompleteMultipartite Graphs
碩士 === 國立臺灣大學 === 數學研究所 === 94 === On investigating the one-way street problem, Robbins proved that a connected graph has a strong orientation if and only if it has no bridges. An interesting and practical problem is that, besides the existence of a strong orientation, what is the minimum diameter o...
Main Authors: | Chien-Yeh Chen, 陳建燁 |
---|---|
Other Authors: | 張鎮華 |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27807474496205981423 |
Similar Items
-
Bell Numbers of Complete Multipartite Graphs
by: Julian Allagan, et al.
Published: (2016-08-01) -
Seidel energy of complete multipartite graphs
by: Oboudi Mohammad Reza
Published: (2021-04-01) -
The Linear 5-Arboricity of Complete Multipartite Graphs
by: Ho-Chieh Lin, et al. -
Linear k-arboricity of Complete Multipartite Graphs
by: Chih-Hung Yen, et al.
Published: (2005) -
The 4-girth-thickness of the complete multipartite graph
by: Christian Rubio-Montiel
Published: (2019-04-01)