EUVIMEDEUVIMED entdecken
Crossref

Burning number of path and cycle related graphs

M. S. Mary Jenifer, A. S. Shanth

Journal of Discrete Mathematical Sciences and Cryptography · 2026 · 29 (3) · 1347-1354

DOI: 10.47974/jdmsc-2582 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences and Cryptography, 2026. Verfasst von M. S. Mary Jenifer und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In network theory the circulation of data is modelled into a graph and the idea of graph burning is applied. Graph burning is the concept of finding the minimum number of moves that takes for the propagation of data in a network. Even in the cases of memes passed in social media platforms like Facebook and Instagram how quickly an information reaches its followers and the impact of it which affects the entire network can be determined by finding the burning number of the network. In this paper we have determined the burning number of a graph which has path attached with a graph which has diameter 2, flower network and sunlet graph.

Zitieren

APA

Jenifer, M. S. M., & Shanth, A. S. (2026). Burning number of path and cycle related graphs. Journal of Discrete Mathematical Sciences and Cryptography, 29(3), 1347-1354. https://doi.org/10.47974/jdmsc-2582

Vancouver

Jenifer MSM, Shanth AS. Burning number of path and cycle related graphs. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(3):1347-1354. doi:10.47974/jdmsc-2582

BibTeX
@article{Jenifer2026,
  author = {Jenifer, M. S. Mary and Shanth, A. S.},
  title = {Burning number of path and cycle related graphs},
  journal = {Journal of Discrete Mathematical Sciences and Cryptography},
  year = {2026},
  volume = {29},
  number = {3},
  pages = {1347--1354},
  doi = {10.47974/jdmsc-2582}
}
Kostenlos starten →