OrderDegree Sequences
Bold, Christoph
(1989)
OrderDegree Sequences.
Published in:
Ars Combinatoria : a Canadian journal of combinatorics Vol. 27.
pp. 113116.
Abstract
Let G be a graph with vertices x1,...,xn. The orderdegree sequence of G is the maximal ntuple (a1,...,an)=(a(x1),...,a(xn)) of nonnegative integers such that, for i=1(1)n, vertex xi is joined to distinct vertices y1,...,y{asb i} with a(yj) >= j for j=1(1)asb i. We present an algorithm for computing orderdegree sequences and study their impact on independence numbers and connectivities. For instance, if n>=3, then the connectivity of G is at least (smax+sminn+3), where smax and smin are the largest and the smallest component of the orderdegree sequence of G.
Item Type:  Article 

Citations:  0 (Web of Science) 
Uncontrolled Keywords:  connectivity independence numbers orderdegree sequence 
Subjects: 

Divisions:  Mathematical Institute 
Related URLs: 
ZAIK Number:  zpr86038 

Depositing User:  Archive Admin 
Date Deposited:  02 Apr 2001 00:00 
Last Modified:  24 Oct 2011 12:47 
URI:  http://earchive.informatik.unikoeln.de/id/eprint/38 