The Surviving Rate of IC-Planar Graphs
Let <i>k</i> and <i>n</i> be two positive integers. Firefighting is a discrete dynamical process of preventing the spread of fire. Let <i>G</i> be a connected graph <i>G</i> with <i>n</i> vertices. Assuming a fire starts at one of the verti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-06-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/14/6/1258 |