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

Monotony properties of connected visible graph searching

โœ Scribed by Pierre Fraigniaud; Nicolas Nisse

Book ID
113641799
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
203 KB
Volume
206
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Connectivity of Visibility Graphs
On the Connectivity of Visibility Graphs
โœ Payne, Michael S.; Pรณr, Attila; Valtr, Pavel; Wood, David R. ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English โš– 498 KB
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

Hamiltonian properties of the cube of a
Hamiltonian properties of the cube of a 2-edge connected graph
โœ M. Paoli ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al