𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The expressibility of fragments of Hybrid Graph Logic on finite digraphs

✍ Scribed by Gate, James; Stewart, Iain A.

Book ID
120705503
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
501 KB
Volume
11
Category
Article
ISSN
1570-8683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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