On (2,1)-total labelings of generalized Petersen graphs
碩士 === 中原大學 === 應用數學研究所 === 99 === A (p,1)- total labeling of G is an assignment of integers to V(G)∪E(G) such that any two adjacent vertices of G receive distinct integers, any two adjacent edges of G receive distinct integers, and a vertex and its incident edge receive integers that differ by at...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/62589175742561935025 |
id |
ndltd-TW-099CYCU5507012 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099CYCU55070122015-10-13T20:23:24Z http://ndltd.ncl.edu.tw/handle/62589175742561935025 On (2,1)-total labelings of generalized Petersen graphs 廣義彼得森圖的(2,1)-全標號 FANG-CHI CHI 紀芳琪 碩士 中原大學 應用數學研究所 99 A (p,1)- total labeling of G is an assignment of integers to V(G)∪E(G) such that any two adjacent vertices of G receive distinct integers, any two adjacent edges of G receive distinct integers, and a vertex and its incident edge receive integers that differ by at least p in absolute value. The span of a (p,1)-total labeling is the maximum difference between two labels. The minimum span of a (p,1)-total labeling of G is called the (p,1)-total number and denoted by λ^T_P(G). Let n and k be two positive integers. The graph with vertex sets {u(1),...,u(n)} and {v(1),...,v(n)} and edge sets {u(i)u(i+1)|i=1,2,...,n},{u(i)v(i)|i=1,2,...,n} and {v(i)v(i+k)|i=1,2,...,n;k<n}, where addition is modulo n is called generalized Petersen graph and denoted by P(n,k). In this thesis, we mainly focus on the (2,1)-total labeling of the generalized Petersen graph, and we show that for each pair of positive integer n and k, 1<=n, if n≡0(mod 5) and k≠0(mod 5), then λ^T_2(P(n,k))=5. Moreover, we also prove that λ^T_2(P(n,5))=5 if n≡0(mod 25). Chin-Lin Shiue 史青林 2011 學位論文 ; thesis 15 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 中原大學 === 應用數學研究所 === 99 === A (p,1)- total labeling of G is an assignment of integers to V(G)∪E(G) such that any two adjacent vertices of G receive distinct integers, any two adjacent edges of G receive distinct integers, and a vertex and its incident edge receive integers that differ by at least p in absolute value. The span of a (p,1)-total labeling is the maximum difference between two labels. The minimum span of a (p,1)-total labeling of G is called the (p,1)-total number and denoted by λ^T_P(G).
Let n and k be two positive integers. The graph with vertex sets {u(1),...,u(n)} and {v(1),...,v(n)} and edge sets {u(i)u(i+1)|i=1,2,...,n},{u(i)v(i)|i=1,2,...,n} and {v(i)v(i+k)|i=1,2,...,n;k<n}, where addition is modulo n is called generalized Petersen graph and denoted by P(n,k).
In this thesis, we mainly focus on the (2,1)-total labeling of the generalized Petersen graph, and we show that for each pair of positive integer n and k, 1<=n, if n≡0(mod 5) and k≠0(mod 5), then λ^T_2(P(n,k))=5. Moreover, we also prove that λ^T_2(P(n,5))=5 if n≡0(mod 25).
|
author2 |
Chin-Lin Shiue |
author_facet |
Chin-Lin Shiue FANG-CHI CHI 紀芳琪 |
author |
FANG-CHI CHI 紀芳琪 |
spellingShingle |
FANG-CHI CHI 紀芳琪 On (2,1)-total labelings of generalized Petersen graphs |
author_sort |
FANG-CHI CHI |
title |
On (2,1)-total labelings of generalized Petersen graphs |
title_short |
On (2,1)-total labelings of generalized Petersen graphs |
title_full |
On (2,1)-total labelings of generalized Petersen graphs |
title_fullStr |
On (2,1)-total labelings of generalized Petersen graphs |
title_full_unstemmed |
On (2,1)-total labelings of generalized Petersen graphs |
title_sort |
on (2,1)-total labelings of generalized petersen graphs |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/62589175742561935025 |
work_keys_str_mv |
AT fangchichi on21totallabelingsofgeneralizedpetersengraphs AT jìfāngqí on21totallabelingsofgeneralizedpetersengraphs AT fangchichi guǎngyìbǐdésēntúde21quánbiāohào AT jìfāngqí guǎngyìbǐdésēntúde21quánbiāohào |
_version_ |
1718047433873686528 |