Degree Sequences and Statuses in Graphs

博士 === 國立中央大學 === 數學研究所 === 100 === In this thesis, we consider some problems about degree sequences and statuses of graphs. In Chapter 2 we obtain the graphs which are degree unique in trees, connected regular graphs, forests, unicyclic graphs and bicyclic graphs, respectively. In Chapter 3 we cons...

Full description

Bibliographic Details
Main Authors: Wei-han Tsai, 才維翰
Other Authors: Chiang Lin
Format: Others
Language:en_US
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/19584527171783016935
id ndltd-TW-100NCU05479002
record_format oai_dc
spelling ndltd-TW-100NCU054790022015-10-13T21:22:20Z http://ndltd.ncl.edu.tw/handle/19584527171783016935 Degree Sequences and Statuses in Graphs 圖的程度序列和狀態 Wei-han Tsai 才維翰 博士 國立中央大學 數學研究所 100 In this thesis, we consider some problems about degree sequences and statuses of graphs. In Chapter 2 we obtain the graphs which are degree unique in trees, connected regular graphs, forests, unicyclic graphs and bicyclic graphs, respectively. In Chapter 3 we consider the problem of embedding a given graph as the median of another graph. We investigate the problem in the weighted version and for some related notions such as antimedian and i-th median (i = 1, 2, . . .). In Chapter 4 we investigate the variance spectrums of graphs. We also characterize the graphs whose minimum statuses attain the minimum in the family of graphs with fixed maximum degree and order Chiang Lin 林強 2012 學位論文 ; thesis 71 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 博士 === 國立中央大學 === 數學研究所 === 100 === In this thesis, we consider some problems about degree sequences and statuses of graphs. In Chapter 2 we obtain the graphs which are degree unique in trees, connected regular graphs, forests, unicyclic graphs and bicyclic graphs, respectively. In Chapter 3 we consider the problem of embedding a given graph as the median of another graph. We investigate the problem in the weighted version and for some related notions such as antimedian and i-th median (i = 1, 2, . . .). In Chapter 4 we investigate the variance spectrums of graphs. We also characterize the graphs whose minimum statuses attain the minimum in the family of graphs with fixed maximum degree and order
author2 Chiang Lin
author_facet Chiang Lin
Wei-han Tsai
才維翰
author Wei-han Tsai
才維翰
spellingShingle Wei-han Tsai
才維翰
Degree Sequences and Statuses in Graphs
author_sort Wei-han Tsai
title Degree Sequences and Statuses in Graphs
title_short Degree Sequences and Statuses in Graphs
title_full Degree Sequences and Statuses in Graphs
title_fullStr Degree Sequences and Statuses in Graphs
title_full_unstemmed Degree Sequences and Statuses in Graphs
title_sort degree sequences and statuses in graphs
publishDate 2012
url http://ndltd.ncl.edu.tw/handle/19584527171783016935
work_keys_str_mv AT weihantsai degreesequencesandstatusesingraphs
AT cáiwéihàn degreesequencesandstatusesingraphs
AT weihantsai túdechéngdùxùlièhézhuàngtài
AT cáiwéihàn túdechéngdùxùlièhézhuàngtài
_version_ 1718061246117314560