EUVIMEDEUVIMED entdecken
Crossref

Monophonic Cover Pebbling Number \((MCPN)\) of Network Graphs

A. Lourdusamy, S. Kither Iammal, I. Dhivviyanandam

Utilitas Mathematica · 2024

DOI: 10.61091/um121-02 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von A. Lourdusamy und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given a connected graph \(G\) and a configuration \(D\) of pebbles on the vertices of \(G\), a pebbling transformation involves removing two pebbles from one vertex and placing one pebble on its adjacent vertex. A monophonic path is defined as a chordless path between two non-adjacent vertices \(u\) and \(v\). The monophonic cover pebbling number, \(\gamma_{\mu}(G)\), is the minimum number of pebbles required to ensure that, after a series of pebbling transformations using monophonic paths, all vertices of \(G\) are covered with at least one pebble each. In this paper, we determine the monophonic cover pebbling number (\(MCPN\)) for the gear graph, sunflower planar graph, sun graph, closed sun graph, tadpole graph, lollipop graph, double star-path graph, and a class of fuses.

Zitieren

APA

Lourdusamy, A., Iammal, S. K., & Dhivviyanandam, I. (2024). Monophonic Cover Pebbling Number \((MCPN)\) of Network Graphs. Utilitas Mathematica. https://doi.org/10.61091/um121-02

Vancouver

Lourdusamy A, Iammal SK, Dhivviyanandam I. Monophonic Cover Pebbling Number \((MCPN)\) of Network Graphs. Utilitas Mathematica. 2024. doi:10.61091/um121-02

BibTeX
@article{Lourdusamy2024,
  author = {Lourdusamy, A. and Iammal, S. Kither and Dhivviyanandam, I.},
  title = {Monophonic Cover Pebbling Number \((MCPN)\) of Network Graphs},
  journal = {Utilitas Mathematica},
  year = {2024},
  doi = {10.61091/um121-02}
}
Kostenlos starten →