Suppose $G$ is a graph and $e=ab$ is an edge of $G$. For a
positive integer $k$, the $G$-necklace of length $k$ (with respect
to edge $e$), denoted by $N_k(G)$, is the graph constructed as
follows: Take the vertex disjoint union of $k$ copies of $G$, say
$Q_1 cup Q_2 cup cdots cup Q_k$, where each $Q_i$ is a copy of
$G$, with $e_i=a_ib_i$ be the copy of $e=a b$ in $Q_i$. Add a
vertex $u$, delete the edges $e_i$ for $i=1, 2, cdots, k$ and
add edges: $ua_1, b_1a_2, b_2a_3, cdots, b_{k-1}a_k, b_ku$. This
thesis determines the circular chromatic indexes of $G$-necklaces
for $G = K_{2n}$ and $G= K_{m, m}$.(¨£¹q¤l½×¤å²Ä¤»¶)
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0715105-004218 |
| Date | 15 July 2005 |
| Creators | Jhan, Wen-min |
| Contributors | none, none, Xuding Zhu, none |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0044 seconds