English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27308/39152
Visitors : 2448093      Online Users : 131
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/30956

Title: 預備完美圖形及有關完美可序列化圖形的探討
Preperfect Graphs and Some Related Problems on Perfectly Orderable Graphs
Authors: Chun-Hung Wang
王淳弘
Contributors: NTOU:Department of Computer Science and Engineering
國立臺灣海洋大學:資訊工程學系
Keywords: 預備完美圖形;非預備完美圖形;完美有序圖形
Preperfect Graphs;Non-Preperfect Graphs;Perfectly Orderable Graphs
Date: 2012
Issue Date: 2012-04-16T03:20:18Z
Abstract: 在這篇論文中我們討論「路徑長m與路徑長n乘積圖」(Pm × Pn Graphs)的補圖和其他圖形之間的關係。我們也描述了一些「完美有序圖形」(Perfectly Orderable Graphs)的類別。並討論其與「樹」(Tn Graphs)的補圖間的關係。 再來,我們證明某些家族的補圖是「預備完美圖形」(Preperfect Graphs)。 最後我們找出一些無限的「極小非預備完美圖形」(Minimal Non-Preperfect Graphs)家族。
In this paper we discuss complement of Pm × Pn graphs and the relation with other graphs. We also characterize some classes of perfectly orderable graphs. And discuss the relation with complement of Tn graphs. Next, we show complement of C2n, Tn, and Sn graphs are preperfect graphs. Finally, we find out some infinite families of minimal non-preperfect graphs that are perfect graphs.
URI: http://ethesys.lib.ntou.edu.tw/cdrfb3/record/#G0M98570021
http://ntour.ntou.edu.tw/handle/987654321/30956
Appears in Collections:[資訊工程學系] 博碩士論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML201View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback