完整後設資料紀錄
DC 欄位語言
dc.contributor.authorShiue, Chin-Linen_US
dc.contributor.authorFu, Hung-Linen_US
dc.date.accessioned2014-12-08T15:09:45Z-
dc.date.available2014-12-08T15:09:45Z-
dc.date.issued2009-04-01en_US
dc.identifier.issn1027-5487en_US
dc.identifier.urihttp://hdl.handle.net/11536/7455-
dc.description.abstractLet 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.language.isoen_USen_US
dc.subjectOptimal pebblingen_US
dc.subjectCaterpillaren_US
dc.titleTHE OPTIMAL PEBBLING NUMBER OF THE CATERPILLARen_US
dc.typeArticleen_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.citation.volume13en_US
dc.citation.issue2Aen_US
dc.citation.spage419en_US
dc.citation.epage429en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000265973200005-
dc.citation.woscount1-
顯示於類別:期刊論文