𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super Connectivity of Line Graphs and Digraphs

✍ Scribed by Min Lü; Jun-Ming Xu

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2006
Tongue
English
Weight
121 KB
Volume
22
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super link-connectivity of iterated line
Super link-connectivity of iterated line digraphs
✍ Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo; Lu Ruan; Jianhua Sun; Weili W 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this pape

Distance connectivity in graphs and digr
Distance connectivity in graphs and digraphs
✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

On super-edge-connected digraphs and bip
On super-edge-connected digraphs and bipartite digraphs
✍ M. A. Fiol 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 524 KB

## Abstract A maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diamet

The connectivity of large digraphs and g
The connectivity of large digraphs and graphs
✍ M. A. Fiol 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 632 KB

## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree δ, maximum degree Δ, diameter __D__, and a new parameter l~pi;~, __0__ ≤ π ≤ δ − 2, related with the number of short paths (in the case of graphs

Connectivity of large bipartite digraphs
Connectivity of large bipartite digraphs and graphs
✍ M.C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu