Pebbling on Jahangir graphs

arXiv1705.00190MaRDI QIDQ6286097FDOQ6286097

Authors: Zheng-Jiang Xia, Zhen-Mu Hong, Fuyuan Chen 

Publication date: 29 April 2017

Abstract: The pebbling number of a graph $G$, $f(G)$, is the least $p$ such that, however $p$ pebbles are placed on the vertices of $G$, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. In this paper, we will show the pebbling number of Jahangir graphs $J_{n,m}$ with $n$ even, $mgeq8$.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

This page was built for publication: Pebbling on Jahangir graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286097)