Share Your Research, Maximize Your Social Impacts
The pebbling number of 4-star graph
Journal: Sciencia Acta Xaveriana (Vol.2, No. 2)Publication Date: 2011-09-01
Authors : A. Punitha Tharani A. Lourdusamy;
Page : 29-59
Keywords : pebbling number; 4-star graph;
Source : Download
Find it from : Google Scholar
Abstract
A pebbling move on a graph G consists of taking two pebbles off onevertex and placing one pebble to an adjacent vertex. The pebbling number of a connected graph G, f(G), is the least n such that any distribution of n pebbles on G allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves. In this paper we will determine the pebbling number of 4-star graph.
Other Latest Articles
- Cyanobacteria to the effect of NaCl on growth and Biochemical characters
- Changes in qualitative and quantitative traits in the bivoltine silkworm hybrid of bombyx mori L. due to changing environmental conditions
- Vibrational spectroscopy (FTIR and FTRaman) investigation using DFT analysis on the structure of 2-chloro-5-nitropyridine
- Path magic graphs
- On a special case of the Diophantine equation “ax2+bx+c=dyn”
Last modified: 2014-08-19 14:06:19