EUVIMEDEUVIMED entdecken
Crossref

Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices

Toshinori Sakai

SUT Journal of Mathematics · 2002

DOI: 10.55937/sut/1057898618 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SUT Journal of Mathematics, 2002. Verfasst von Toshinori Sakai. Die Arbeit nennt 2 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let k≥2 and n≥1 be integers, let G be a graph of order n with minimum degree at least k + 1. Let υ1,υ2,…,υk be k distinct vertices of G, and suppose that there exist k vertex disjoint cycles C1,…,Ck in G such that υi∈V(Ci) for each 1≤i≤k. Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct vertices is greater than or equal to n+k−43. Under these assumptions, we show that there is a 2-factor of G with k cycles D1,D2,…,Dk such that υi∈V(Di) for each 1≤i≤k.

Zitieren

APA

Sakai, T. (2002). Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices. SUT Journal of Mathematics. https://doi.org/10.55937/sut/1057898618

Vancouver

Sakai T. Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices. SUT Journal of Mathematics. 2002. doi:10.55937/sut/1057898618

BibTeX
@article{Sakai2002,
  author = {Sakai, Toshinori},
  title = {Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices},
  journal = {SUT Journal of Mathematics},
  year = {2002},
  doi = {10.55937/sut/1057898618}
}
Kostenlos starten →