Monophonic cover pebbling number of standard and algebraic Graphs
Keywords:
cover pebbling, monophonic pebbling, monophonic cover pebbling, zero divisor, unit graphsAbstract
Given a connected graph G and a configuration $D$ of pebbles on the vertices of $G$, a pebbling transformation takes place by removing two pebbles from one vertex and placing one pebble on its adjacent vertex. A monophonic path is considered to be a longest chordless path between two vertices $u$ and $v$ which are not adjacent. A monophonic cover pebbling number, $\gamma_\mu\left(G\right)$, is a minimum number of pebbles required to cover all the vertices of $G$ with at least one pebble each on them after the transfermation of pebbles by using monophonic paths. In this paper we determine the monophonic cover pebbling number of cycles, square of cycles, shadow graph of cycles, complete graphs, Jahangir graphs, fan graphs, zero divisor graphs and unit graphs.
Downloads
References
A. Lourdusamy, I. Dhivviyanandam and S. Kither iammal, Monophonic pebbling number
and t-pebbling number of some graphs, AKCE International Journal of Graphs and Combi-
natorics, (2022), DOI: 10. 1080/09728600.2022.207278.
A. Lourdusamy, S. Kither iammal and I. Dhivviyanandam, Detour pebbling number
on some commutative ring graphs, Communications in Mathematics and Applications,
ISSN 0975-8607 (Online), 0976-5905 (Print), Vol. 14, No. 1, (2023), 323-331. DOI:
26713/cma.v14i1.2018
A. Lourdusamy, S. Kither iammal and I. Dhivviyanandam Monophonic cover pebbling num-
ber of some path related Graphs, Industrial Engineering Journal, Volume-52, Issue 4, No.2,
April 2023, ISSN 0970-2555, Page 167-170. (Accepted for publication).
A.P. Santhakumaran and P. Titus, Monophonic distance in graphs. Discrete Mathematics,
Algorithms and Applications 3.02 (2011): pp: 159-169. DOI: 10.5772/intechopen.68668
B. Crull, T. Cundiff, P. Feltman, G. Hurlbert, L. Pudell, Z. Szaniszlo, and Z.
Tuza, The cover pebbling number of graphs, Discrete Math. 296(1), 2005, 15-23.
DOI:10.1016/j.disc.2005.03.009
Beeler, R. A., Haynes, T. W., Henning, M. A., & Keaton, R. Total domination cover rub-
bling. Discrete Applied Mathematics, (2020), 283, 133-141. DOI: 10.1016/j.dam.2019.12.020
D.F. Anderson and P. S. Livingston, The zero-divisor graph of a commutative ring, Journal
of algebra 217, no. 2(1999): 434-447. DOI: 10.1006/jabr.1998.7840
F. Harary: Graph Theory, Narosa Publishing House, New Delhi.
F.R.K. Chung, Pebbling in hypercubes, SIAMJ. Disc. Math., 2(4) (1989), pp. 467-472. DOI:
1137/0402041
Gary Chartrand, Introductory Graph theory, Dover books on Mathematics, (1985).
H. R. Maimani, M. R. Pournaki, and S. Yassemi. Weakly perfect graphs arising from rings.
Glasgow Mathematical Journal 52:3 (2010) : 417-425. DOI: 10.1017/S0017089510000108.
J.A. Bondy and U.S.R. Murty, Graph theory with applications, (1977).
Ma, Xuanlong, Huaquan Wei, and Liying Yang. The coprime graph of a group. (2014) :
- 23.DOI: 10.22108/IJGT.2014.4363
Michael E. Subido and Imelda S. Aniversario, The cover pebbling number of the join of
some graphs,Applied Mathematical Science (2014). DOI: 10.12988/ams.2014.45377
R. Jayagopal and V. Raju, Domination Parameters in Shadow Graph and Path Connected
Graph, International Journal of Mathematics And its Applications, 6(2-B)(2018), 167-172,
ISSN: 2347-1557, Available Online: http://ijmaa.in/
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.