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 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
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
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.