EUVIMEDEUVIMED entdecken
Open Access · CC0

A note on the almost 1-tough graph

Yirong Zheng, Hongzhang Chen, Sarula Chang

Filomat · 2025 · 39 (27) · 9569-9577

DOI: 10.2298/fil2527569z ↗

Kurz gefasst

Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Yirong Zheng und 2 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph G is almost 1-tough if c(G-S) ? |S| + 1 for any S ? V(G), where c(G-S) is the number of components of G-S. Let F: V(G) ? {{1}, {0, 2}} be a set-valued function and F^{-1}(1) := {v ? V(G): ? (v) = {1}} . A spanning subgraph H of G is called an F-factor if \mathrm{d_H} (v) ? F(v) for all v ? V(G). It is interesting to know whether a graph is almost 1-tough or a graph has an F-factor. In this note, we establish a lower bound on the size (resp. the spectral radius) to ensure a graph to be almost 1-tough. This also provide a sufficient condition for the existence of an F-factor for which every F: V(G) ? {{1}, {0, 2}} with | F^{-1} (1)| even in a graph.

Zitieren

APA

Zheng, Y., Chen, H., & Chang, S. (2025). A note on the almost 1-tough graph. Filomat, 39(27), 9569-9577. https://doi.org/10.2298/fil2527569z

Vancouver

Zheng Y, Chen H, Chang S. A note on the almost 1-tough graph. Filomat. 2025;39(27):9569-9577. doi:10.2298/fil2527569z

BibTeX
@article{Zheng2025,
  author = {Zheng, Yirong and Chen, Hongzhang and Chang, Sarula},
  title = {A note on the almost 1-tough graph},
  journal = {Filomat},
  year = {2025},
  volume = {39},
  number = {27},
  pages = {9569--9577},
  doi = {10.2298/fil2527569z}
}
Kostenlos starten →