𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the restricted arc-connectivity ofs-geodetic digraphs

✍ Scribed by Camino Balbuena; Pedro García-Vázquez

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2010
Tongue
English
Weight
237 KB
Volume
26
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks on Arc-connectivity, vertex
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs
✍ Bill Jackson 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio

On the distance connectivity of graphs a
On the distance connectivity of graphs and digraphs
✍ M.A. Fiol; J. Fàbrega 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be

The recognition of geodetically connecte
The recognition of geodetically connected graphs
✍ Jou-Ming Chang; Chin-Wen Ho 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Let G = ( y E) be a graph with vertex set V of size n and edge set E of size m. A vertex LJ E V is called a hinge vertex if the distance of any two vertices becomes longer after u is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected