پیوندهای مفید
آمار
| تعداد نشریات | 31 |
| تعداد شمارهها | 484 |
| تعداد مقالات | 4,286 |
| تعداد مشاهده مقاله | 7,298,689 |
| تعداد دریافت فایل اصل مقاله | 4,896,197 |
2-Restricted optimal pebbling number of some dendrimers | ||
| Journal of Hyperstructures | ||
| دوره 15، شماره 1، شهریور 2026، صفحه 83-90 اصل مقاله (2.8 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22098/jhs.2026.18742.1152 | ||
| نویسندگان | ||
| Juma Gul Dehqan1؛ Saeid Alikhani* 2؛ Ali Delavarkhalafi1 | ||
| 1Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran | ||
| 2Department of Mathematics, Yazd University, Yazd , Iran | ||
| چکیده | ||
| This paper studies the 2-restricted optimal pebbling number of certain dendrimer graphs. In graph pebbling, a configuration is a distribution of pebbles on the vertices of a simple connected graph G. A pebbling move removes two pebbles from a vertex and places one on an adjacent vertex. A t-restricted pebbling configuration (tRPC) is an initial placement where no vertex holds more than t pebbles. A configuration is solvable if, for any target vertex v, a sequence of pebbling moves can place at least one pebble on v. The t-restricted optimal pebbling number, denoted πt*(G), is the minimum number of pebbles required for a solvable tRPC on G. We focus on the case t=2 and determine π2*(G) for several classes of dendrimers. | ||
| کلیدواژهها | ||
| Pebbling number؛ Optimal pebbling number؛ $t$-restricted optimal pebbling number؛ $2$-restricted optimal pebbling confugration | ||
| مراجع | ||
|
[1] F. Aghaei and S. Alikhani, Pebbling number of polymers, Iran. J. Math. Chem., 16 (1) (2025), 39-49. [2] M. Albertson and K. Collins, Symmetry breaking in graphs, Electron. J. Combin., 3 (1) (1996), R18. [3] S. Alihkani and F. Aghaei, More on the 2-Restricted optimal pebbling number, Bol. Soc. Parana. Mat. (43) (2025) 1-6. [4] S. Alikhani, M.A. Iranmanesh and H. Taheri, Harary Index of Dendrimer Nanostar NS2[n], MATCH Comm. Math. Comp. Chem., 71 (2) (2014), 383-394. [5] S. Alikhani, R. Hasni and N.E. Arif, On the Atom-Bond Connectivity Index of Some Families of Dendrimers, J. Comp. Theor. Nano., 11 (2014), 1-4. [6] D.P. Bunde, E.W. Chambers, D. Cranston, K. Milans, D.B. West, Pebbling and optimal pebbling in graphs, J. Graph Theory, 57 (2008), 215-238. [7] M. Chellali, T.W. Haynes, S.T. Hedetniemi and T.M. Lewis, Restricted optimal pebbling and domination in graphs, Discrete Appl. Math., 221 (2017), 46-53. [8] F. R. K. Chung, Pebbling in hypercubes, SIAM J. Disc. Math., 2 (4) (1989), 467-472. [9] E.J. Cockayne, P.M. Dreyer Sr., S.M. Hedetniemi, S.T. Hedetniemi, On Roman domination in graphs, Discrete Math., 278 (2004), 11-22. [10] T. Friedman and C. Wyels, Optimal pebbling of paths and cycles, Discrete Math. (2005) Manuscript (arXiv: math.CO/0506076). [11] H. Fu and C. Shiue, The optimal pebbling number of the complete m-ary tree, Discrete Math., 222 (2000), 89-100. [12] H. Fu, K. Huang, C. Shiue, A note on optimal pebbling of hypercubes, J. Comb. Optim., 25 (2013), 597-601. [13] D.S. Herscovici, Using error-correcting codes to construct solvable pebbling distributions, Discrete Math., 339 (2016), 318-326. [14] D. S. Herscovici, B. D. Hester, G. H. Hurlbert, Optimal pebbling in products of graphs, Australas. J. Combin., 50 (2011), 3-24. [15] P. Lemke and D. Kleitman, An addition theorem on the integers modulo n, J. Number Theory, 31 (1989), 335-345. [16] T. Lewis, C.A. Cusack, L. Dion, The complexity of pebbling reachability and solvability in planar and outerplanar graphs, Discrete Appl. Math., 172 (2014), 62-74. [17] K. Milans and B. Clark, The complexity of graph pebbling, SIAM J. Discrete Math., 20 (2006), 769-798. [18] D. Moews, Optimally pebbling hypercubes and powers, Discrete Math., 190 (1998), 271-276. [19] J. Muntz, S. Narayan, N. Streib, K. VanOchten, Optimal pebbling of graphs, Discrete Math., 307 (2007), 2315-2321. [20] L. Pachtor, H.S. Snevily, B. Voxman, On pebbling graphs, Congr. Numer., 107 (1995), 65-80. [21] C. Shiue and H. Fu, The optimal pebbling number of the caterpillar, Taiwanese J. Math., 13 (2009), 419-429. [22] Y. Ye, M. Liu, J. Gao, The optimal pebbling number of square of paths and cycles, Ars Combin., 114 (2014), 363-371. | ||
|
آمار تعداد مشاهده مقاله: 140 تعداد دریافت فایل اصل مقاله: 73 |
||