東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Covering cover pebbling number of pr...

McGahan, Ian.

FindBook

Google Book

Amazon

博客來

Covering cover pebbling number of products of paths.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Covering cover pebbling number of products of paths./
作者:	McGahan, Ian.
面頁冊數:	40 p.
附註:	Source: Masters Abstracts International, Volume: 55-02.
Contained By:	Masters Abstracts International55-02(E).
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1601430
ISBN:	9781339129419

Covering cover pebbling number of products of paths.
McGahan, Ian.

Covering cover pebbling number of products of paths. - 40 p.

Source: Masters Abstracts International, Volume: 55-02.

Thesis (M.S.)--University of Minnesota, 2015.

There are a variety of pebbling numbers, such as classical pebbling number, cover pebbling number, and covering cover pebbling number. In this paper we determine the covering cover pebbling number for Cartesian products of paths. The covering cover pebbling number of a graph, G, is the smallest number of pebbles, n, required such that any distribution of n pebbles onto the vertices of G can be, through a sequence of pebbling moves, redistributed so that C, a vertex cover of G, is pebbled. Traditionally, a pebbling move is defined as the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. In this paper we provide an alternative proof for the covering cover pebbling number of cycles and prove the covering cover pebbling number for a Cartesian product of paths.

ISBN: 9781339129419Subjects--Topical Terms:

515831
Mathematics.

Covering cover pebbling number of products of paths.
LDR:01667nmm a2200277 4500 001 2070609
005 20160617121825.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781339129419
035 $a (MiAaPQ)AAI1601430
035 $a AAI1601430
040 $a MiAaPQ $c MiAaPQ
100 1 $a McGahan, Ian. $3 3185675
245 1 0 $a Covering cover pebbling number of products of paths.
300 $a 40 p.
500 $a Source: Masters Abstracts International, Volume: 55-02.
500 $a Advisers: Dalibor Froncek; Sylwia Cichacz-Przenioslo.
502 $a Thesis (M.S.)--University of Minnesota, 2015.
520 $a There are a variety of pebbling numbers, such as classical pebbling number, cover pebbling number, and covering cover pebbling number. In this paper we determine the covering cover pebbling number for Cartesian products of paths. The covering cover pebbling number of a graph, G, is the smallest number of pebbles, n, required such that any distribution of n pebbles onto the vertices of G can be, through a sequence of pebbling moves, redistributed so that C, a vertex cover of G, is pebbled. Traditionally, a pebbling move is defined as the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. In this paper we provide an alternative proof for the covering cover pebbling number of cycles and prove the covering cover pebbling number for a Cartesian product of paths.
590 $a School code: 0130.
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
690 $a 0405
690 $a 0642
710 2 $a University of Minnesota. $b Applied and Computational Mathematics. $3 3185672
773 0 $t Masters Abstracts International $g 55-02(E).
790 $a 0130
791 $a M.S.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1601430