On the cooling number of the generalized Petersen graphs
Recently, Bonato et al. (2024) introduced a new graph parameter, which is the cooling number of a graph $ G $, denoted as CL$ (G) $. In contrast with burning which seeks to minimize the number of rounds to burn all vertices in a graph, cooling seeks to maximize the number of rounds to cool all verti...
Saved in:
Main Authors: | Kai An Sim, Kok Bin Wong |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-12-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241724 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Radiology insights into Petersen's hernia complication of post Roux-en-Y gastric bypass
by: Kennedy Wong, et al.
Published: (2025-03-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
by: Ramy Shaheen, et al.
Published: (2020-01-01) -
Forest decompositions of graphs with cyclomatic number 2
by: E. J. Farrell
Published: (1983-01-01) -
Dynamic Spatial–Temporal Graph Neural Network for Cooling Capacity Prediction in HVDC Systems
by: Hao Sun, et al.
Published: (2025-01-01)