A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties

碩士 === 中原大學 === 應用數學研究所 === 91 === In this paper, we introduce a simple scheme for generating ``{sl good}" bipartite graphs. A bipartite graph $G$ with bipartition $W$ and $B$ is a good graph if it is {sl 1-hamiltonian} and {sl hamiltonian laceable}. More specifically, $G$ is good if $G-F$ rema...

Full description

Bibliographic Details
Main Authors:	Yu-Chih Chen, 陳育志
Other Authors:	Shin-Shin Kao
Format:	Others
Language:	en_US
Published:	2003
Online Access:	http://ndltd.ncl.edu.tw/handle/6c9872

id	ndltd-TW-091CYCU5507011
record_format	oai_dc
spelling	ndltd-TW-091CYCU55070112018-06-25T06:06:27Z http://ndltd.ncl.edu.tw/handle/6c9872 A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties 具容錯-漢米爾頓性質之二部圖的建構法 Yu-Chih Chen 陳育志碩士中原大學應用數學研究所 91 In this paper, we introduce a simple scheme for generating ``{sl good}" bipartite graphs. A bipartite graph $G$ with bipartition $W$ and $B$ is a good graph if it is {sl 1-hamiltonian} and {sl hamiltonian laceable}. More specifically, $G$ is good if $G-F$ remains hamiltonian where $F$ consists of an edge or a pair of vertices ${v_1,v_2mid v_1in W, v_2in B}$, and if there exists a hamiltonian path joining $u$ to $v$ for any $uin W, vin B$. This scheme is called ``{sl edge replacement}". Simple examples of good bipartite graphs, as well as the family of {sl brother trees} $BT(n)$ with $nge 1$ cite{KaoBT}, are obtained as an application of edge replacement. Shin-Shin Kao 高欣欣 2003 學位論文 ; thesis 27 en_US
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
description	碩士 === 中原大學 === 應用數學研究所 === 91 === In this paper, we introduce a simple scheme for generating ``{sl good}" bipartite graphs. A bipartite graph $G$ with bipartition $W$ and $B$ is a good graph if it is {sl 1-hamiltonian} and {sl hamiltonian laceable}. More specifically, $G$ is good if $G-F$ remains hamiltonian where $F$ consists of an edge or a pair of vertices ${v_1,v_2mid v_1in W, v_2in B}$, and if there exists a hamiltonian path joining $u$ to $v$ for any $uin W, vin B$. This scheme is called ``{sl edge replacement}". Simple examples of good bipartite graphs, as well as the family of {sl brother trees} $BT(n)$ with $nge 1$ cite{KaoBT}, are obtained as an application of edge replacement.
author2	Shin-Shin Kao
author_facet	Shin-Shin Kao Yu-Chih Chen 陳育志
author	Yu-Chih Chen 陳育志
spellingShingle	Yu-Chih Chen 陳育志 A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
author_sort	Yu-Chih Chen
title	A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
title_short	A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
title_full	A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
title_fullStr	A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
title_full_unstemmed	A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties
title_sort	simple scheme of generating faulty-tolerant bipartite graphs with hamiltonian properties
publishDate	2003
url	http://ndltd.ncl.edu.tw/handle/6c9872
work_keys_str_mv	AT yuchihchen asimpleschemeofgeneratingfaultytolerantbipartitegraphswithhamiltonianproperties AT chényùzhì asimpleschemeofgeneratingfaultytolerantbipartitegraphswithhamiltonianproperties AT yuchihchen jùróngcuòhànmǐěrdùnxìngzhìzhīèrbùtúdejiàngòufǎ AT chényùzhì jùróngcuòhànmǐěrdùnxìngzhìzhīèrbùtúdejiàngòufǎ AT yuchihchen simpleschemeofgeneratingfaultytolerantbipartitegraphswithhamiltonianproperties AT chényùzhì simpleschemeofgeneratingfaultytolerantbipartitegraphswithhamiltonianproperties
_version_	1718706138413793280

A simple scheme of generating Faulty-tolerant bipartite graphs with Hamiltonian properties

Similar Items