𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree sequence conditions for maximally edge-connected oriented graphs

✍ Scribed by Lutz Volkmann

Book ID
108052248
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
152 KB
Volume
19
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree sequence conditions for maximally
Degree sequence conditions for maximally edge-connected graphs and digraphs
✍ Dankelmann, Peter; Volkmann, Lutz 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB 👁 2 views

In this paper we give simple degree sequence conditions for the equality of edge-connectivity and minimum degree of a (di-)graph. One of the conditions implies results by Bollobás, Goldsmith and White, and Xu. Moreover, we give analogue conditions for bipartite (di-)graphs.

Sufficient conditions for graphs to be λ
Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected
✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

## Abstract The restricted‐edge‐connectivity of a graph __G__, denoted by λ′(__G__), is defined as the minimum cardinality over all edge‐cuts __S__ of __G__, where __G__‐__S__ contains no isolated vertices. The graph __G__ is called λ′‐optimal, if λ′(__G__) = ξ(__G__), where ξ(__G__) is the minimum

Sufficient conditions for maximally conn
Sufficient conditions for maximally connected dense graphs
✍ Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 764 KB

This paper considers the relations between the connectivity x or the edge-connectivity A of a graph and other parameters such as the number of vertices n, maximum degree A, minimum degree 6, diameter D and girth g. The following sufficient conditions for maximally connected graphs are derived. 6fir

Edge degree conditions for subpancyclici
Edge degree conditions for subpancyclicity in line graphs
✍ Liming Xiong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 331 KB

In this paper, two best possible edge degree conditions are given for the line graph L(G) of a graph G with girth at least 4 or 5 to be subpaneyclic, i.e., L(G) contains a cycle of length k, for each k between 3 and the circumference of L(G). In [5] the following conjecture is made: If G is a graph

Degree sequence conditions for equal edg
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number
✍ Lutz Volkmann 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract Using the well‐known Theorem of Turán, we present in this paper degree sequence conditions for the equality of edge‐connectivity and minimum degree, depending on the clique number of a graph. Different examples will show that these conditions are best possible and independent of all the