Burning number of Jahangir graphs
From MaRDI portal
Publication:6650883
DOI10.1142/S1793557123501772MaRDI QIDQ6650883FDOQ6650883
Authors: Nilay Torun, Emrah Akyar 
Publication date: 9 December 2024
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Bounds on the burning number
- An upper bound on the burning number of graphs
- Burning a graph as a model of social contagion
- How to Burn a Graph
- On the burning number of generalized Petersen graphs
- Burning number of graph products
- Burning numbers of path forests and spiders
- On the burning number of \(p\)-caterpillars
- Burning number of theta graphs
- Bounds on the burning numbers of spiders and path-forests
- Burning number of caterpillars
- Burning grids and intervals
- Domination in Jahangir graph J_{2,m}
- Some domination parameters in generalized Jahangir graph \(J_{n,m}\)
- Some invariants of Jahangir graphs
- A study of newly defined degree-based topological indices via M-polynomial of Jahangir graph
- Title not available (Why is that?)
This page was built for publication: Burning number of Jahangir graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650883)
