𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Broadcast Independence Number of Grid Graph

✍ Scribed by Isma Bouchemakh, Mohamed Zemir


Book ID
120788793
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
257 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A lower bound on the independence number
✍ Jochen Harant πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

On the bipartite independence number of
✍ Odile Favaron; Pedro Mago; Oscar Ordaz πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

On the independence number of random gra
✍ A.M. Frieze πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 239 KB

Let (Y(G~,~) denote the independence number of the random graph Gn,p. Let d = np. We show that if E > 0 is fixed then with probability going to 1 as n + m cu(G& -$t (log d -log log dlog 2 + 1) < 7 provided d, s d = o(n), where d, is some fixed constant.

Rank numbers of grid graphs
✍ Hannah Alpert πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 295 KB
Bondage number of grid graphs
✍ Dettlaff, Magda; LemaΕ„ska, Magdalena; Yero, Ismael G. πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 513 KB