EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Toughness and isolated toughness conditions for path-factor critical covered graphs

Guowei Dai

RAIRO - Operations Research · 2023-03 · 57 (2) · 847-856

DOI: 10.1051/ro/2023039 ↗

Kurz gefasst

Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 28.04.2023. Verfasst von Guowei Dai. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given a graph G and an integer k ≥ 2. A spanning subgraph H of G is called a P ≥ k -factor of G if every component of H is a path with at least k vertices. A graph G is said to be P ≥ k -factor covered if for any e ∈ E ( G ), G admits a P ≥ k -factor including e . A graph G is called a ( P ≥ k , n )-factor critical covered graph if G – V ′ is P ≥ k -factor covered for any V ′ ⊆ V ( G ) with | V ′| = n . In this paper, we study the toughness and isolated toughness conditions for ( P ≥ k , n )-factor critical covered graphs, where k = 2, 3. Let G be a ( n + 1)-connected graph. It is shown that (i) G is a ( P ≥2 , n )-factor critical covered graph if its toughness $ \tau (G)>\frac{n+2}{3}$; (ii) G is a ( P ≥2 , n )-factor critical covered graph if its isolated toughness $ I(G)>\frac{n+1}{2}$; (iii) G is a ( P ≥3 , n )-factor critical covered graph if $ \tau (G)>\frac{n+2}{3}$ and | V ( G )| ≥ n + 3; (iv) G is a ( P ≥3 , n )-factor critical covered graph if $ I(G)>\frac{n+3}{2}$ and | V ( G )| ≥ n + 3. Furthermore, we claim that these conditions are best possible in some sense.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Dai, G. (2023). Toughness and isolated toughness conditions for path-factor critical covered graphs. RAIRO - Operations Research, 57(2), 847-856. https://doi.org/10.1051/ro/2023039

Vancouver

Dai G. Toughness and isolated toughness conditions for path-factor critical covered graphs. RAIRO - Operations Research. 2023;57(2):847-856. doi:10.1051/ro/2023039

BibTeX
@article{Dai2023,
  author = {Dai, Guowei},
  title = {Toughness and isolated toughness conditions for path-factor critical covered graphs},
  journal = {RAIRO - Operations Research},
  year = {2023},
  volume = {57},
  number = {2},
  pages = {847--856},
  doi = {10.1051/ro/2023039}
}
Kostenlos starten →