Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number

被引：0
|
作者：
Volkmann, Lutz [1 ]
机构：
[1] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
ARS COMBINATORIA | 2011年 / 99卷
关键词：
oriented graph; edge-connectivity; super-edge-connectivity; degree sequence; clique number; BIPARTITE DIGRAPHS; DIRECTED-GRAPHS;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An orientation of a simple graph G is called an oriented graph. If D is an oriented graph, delta(D) its minimum degree and lambda(D) its edge-connectivity, then lambda(D) <= delta(D). The oriented graph is called maximally edge-connected if lambda(D) = delta(D) and super-edge-connected, if every minimum edge-cut is trivial. If D is an oriented graph with the property that the underlying graph G(D) contains no complete subgraph of order p + 1, then we say that the clique number omega(D) of D is less or equal p. In this paper we present degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs D with clique number omega(D) <= p for an integer p >= 2.
引用
收藏
页码：55 / 64
页数：10
相关论文
共 38 条
1234