Remarks on path-factor critical avoidable graphs
Zhou (2023) introduced the concept of path-factor critical avoidable graph and determined several parameter bounds for (P≥2,n) or (P≥3,n)-factor critical avoidable graphs. Certain instances are listed in Zhou (2023) to show that these toughness or isolated toughness bounds are sharp. However, the de...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
KeAi Communications Co., Ltd.
2023-06-01
|
| Series: | International Journal of Cognitive Computing in Engineering |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666307423000074 |
| Summary: | Zhou (2023) introduced the concept of path-factor critical avoidable graph and determined several parameter bounds for (P≥2,n) or (P≥3,n)-factor critical avoidable graphs. Certain instances are listed in Zhou (2023) to show that these toughness or isolated toughness bounds are sharp. However, the derivation processes are flawed. In this remark, we directly modify the derivation processes and obtain the revised bounds. The counterexamples are updated to satisfy κ(G)=n+2. Finally, richness bounds on binding number for a graph to be path-factor critical avoidable are determined. |
|---|---|
| ISSN: | 2666-3074 |