A note on potentially $K_4-e$ graphical sequences

Details A note on potentially $K_4-e$ graphical sequences A note on potentially $K_4-e$ graphical sequences

2003-08-11

arxiv.org/abs/math/0308105v1

Australasian Journal of Combinatorics, 24(2001), 123-127

Mathematics

Combinatorics

5 pages

Scientific paper

A sequence $S$ is potentially $K_4-e$ graphical if it has a realization containing a $K_4-e$ as a subgraph. Let $\sigma(K_4-e, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_4-e, n)$ is potentially $K_4-e$ graphical. Gould, Jacobson, Lehel raised the problem of determining the value of $\sigma (K_4-e, n)$. In this paper, we prove that $\sigma (K_4-e, n)=2[(3n-1)/2]$ for $n\geq 7$, and $n=4,5,$ and $\sigma(K_4-e, 6)= 20$.

Affiliated with

Also associated with

No associations

Rating

A note on potentially $K_4-e$ graphical sequences 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 A note on potentially $K_4-e$ graphical sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on potentially $K_4-e$ graphical sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210708