THE OPTIMAL PEBBLING NUMBER OF THE CATERPILLAR

dc.citation.epage	429	en_US
dc.citation.issue	2A	en_US
dc.citation.spage	419	en_US
dc.citation.volume	13	en_US
dc.citation.woscount	1
dc.contributor.author	Shiue, Chin-Lin	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:09:45Z
dc.date.available	2014-12-08T15:09:45Z
dc.date.issued	2009-04-01	en_US
dc.description.abstract	Let G be a simple graph. If we place p pebbles on the vertices of G, then a pebbling move is taking two pebbles off one vertex and then placing one on an adjacent vertex. The optimal pebbling number of G, f'(G), is the least positive integer p such that p pebbles are placed suitably on vertices of G and for any target vertex nu of G, we can move one pebble to nu by a sequence of pebbling moves. In this paper, we find the optimal pebbling number of the caterpillars.	en_US
dc.identifier.issn	1027-5487	en_US
dc.identifier.journal	TAIWANESE JOURNAL OF MATHEMATICS	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/7455
dc.identifier.wosnumber	WOS:000265973200005
dc.language.iso	en_US	en_US
dc.subject	Optimal pebbling	en_US
dc.subject	Caterpillar	en_US
dc.title	THE OPTIMAL PEBBLING NUMBER OF THE CATERPILLAR	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1