𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the edge connectivity of directed graphs

✍ Scribed by Yishay Mansour; Baruch Schieber

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
577 KB
Volume
10
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Υ… i Υ… 2d Οͺ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

On edge transitivity of directed graphs
On edge transitivity of directed graphs
✍ Jayme L. Szwarcfiter πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 476 KB

We examine edge transitivity of directed graphs. The class of local comparability graphs is defined as the underlying graphs of locally edge transitive digraphs. The latter generalize edge transitive orientations, while local comparability graphs include comparability, anticomparability, and circle