Personal tools
You are here: Home Annual of University of Sofia Tomes archive Tome 97 Balanced vertex sets in graphs

Balanced vertex sets in graphs

Authors: N. Khadzhiivanov, N. Nenov

Let $v_{1},\ldots,v_{r}$ be a $\beta$-sequence (Definition 1.2) in an $n$-vertex graph $G$ and $v_{r+1},\ldots,v_{n}$ be the other vertices of $G$. In this paper we prove that if $v_{1},\ldots,v_{r}$ is balansed, that is $$\ds \frac{1}{r}(d(v_{1})+\ldots +d(v_{r})= \ds \frac{1}{n}(d(v_{1})+\ldots +d(v_{n}),$$ and if the number of edges of $G$ is big enough, then $G$ is regular.

Annotation in PDF format: (PDF document 61Kb)
Keywords: saturated sequence, balanced sequence, generalized r-partite graph, generalized Turan's graph
2000 MSC: 05C35