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

On rainbow-k-connectivity of random graphs

โœ Scribed by Jing He; Hongyu Liang

Book ID
113663329
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
149 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

k-connectivity in random undirected grap
k-connectivity in random undirected graphs
โœ John H Reif; Paul G Spirakis ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 591 KB

This paper concerns vertex connectivity in random graphs. We present results bounding the cardinality of the biggest k-block in random graphs of the G,~p model, for any constant value of k. Our results extend the work of Erd6s and R6nyi and Karp and Tarjan. We prove here that (~.~p, with [9 ~ tin, h

Generalized rainbow connectivity of grap
Generalized rainbow connectivity of graphs
โœ Uchizawa, Kei; Aoki, Takanori; Ito, Takehiro; Zhou, Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 551 KB
On k-leaf connectivity of a random graph
On k-leaf connectivity of a random graph
โœ Thomasz Luczak ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

On k-connectivity for a geometric random
On k-connectivity for a geometric random graph
โœ Mathew D. Penrose ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 255 KB ๐Ÿ‘ 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## ลฝ . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected ลฝ . w x respectively, has minimum degree k