๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lower bounds for sense of direction in regular graphs

โœ Scribed by Paolo Boldi; Sebastiano Vigna

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
237 KB
Volume
16
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimal sense of direction in regular ne
Minimal sense of direction in regular networks
โœ Paola Flocchini ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 683 KB

A network is said to have Sense of Direction when the port labeling satisfies a particular set of global consistency constraints. In this paper we study the link between the topology of a system and the number of labels that are necessary to have a Sense of Direction in that system. We consider syst

Lower bound of cyclic edge connectivity
Lower bound of cyclic edge connectivity for n-extendability of regular graphs
โœ Dingjun Lou; D.A. Holton ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 701 KB

A cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is proved that for any m > 0 and k 2 3, there is an (m, k, k) bipartite graph. A graph G is n-extendable if every matching of size n in G lies in a perfect matching of G. We prove the existence of a (k2-1, k + 1

A lower bound for groupies in graphs
A lower bound for groupies in graphs
โœ Mackey, John ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 145 KB ๐Ÿ‘ 2 views

A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai