The smallest degree sum that yields potentially $C_k$-graphical sequence

Details The smallest degree sum that yields potentially $C_k$-graphical sequence The smallest degree sum that yields potentially $C_k$-graphical sequence

2002-06-06

arxiv.org/abs/math/0206048v2

Journal of Combinatorial Mathematics and Combinatorial Computing 49 (2004), 57-64

Mathematics

Combinatorics

8 pages

Scientific paper

In this paper we consider a variation of the classical Tur\'{a}n-type extremal problems. Let $S$ be an $n$-term graphical sequence, and $\sigma(S)$ be the sum of the terms in $S$. Let $H$ be a graph. The problem is to determine the smallest even $l$ such that any $n$-term graphical sequence $S$ having $\sigma(S)\ge l$ has a realization containing $H$ as a subgraph. Denote this value $l$ by $\sigma(H, n)$. We show $\sigma(C_{2m+1}, n)=m(2n-m-1)+2$, for $m\ge 3$, $n\ge 3m$; $\sigma(C_{2m+2}, n)=m(2n-m-1)+4$, for $m\ge 3, n\ge 5m-2$.

Affiliated with

Also associated with

No associations

Rating

The smallest degree sum that yields potentially $C_k$-graphical sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The smallest degree sum that yields potentially $C_k$-graphical sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The smallest degree sum that yields potentially $C_k$-graphical sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436091