✦ LIBER ✦

Independent sets in random sparse graphs

✍ Scribed by Pedro G. Gazmuri

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 418 KB
Volume: 14
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230140302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bisecting sparse random graphs

✍ Malwina J. Luczak; Colin McDiarmid 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

Maximal independent sets in bipartite gr

Maximal independent sets in bipartite graphs

✍ Jiuqiang Liu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB 👁 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as

Sparse pseudo-random graphs are Hamilton

Sparse pseudo-random graphs are Hamiltonian

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a __d__‐regular graph __G__ on __n__ vertices satisfies and __n__ is large enough, then __G__ is Hamiltonian. We also show how our main resu

The Diameter of Sparse Random Graphs

✍ Fan Chung; Linyuan Lu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 150 KB

We consider the diameter of a random graph G n p for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of rand

Independent perfect domination sets in C

Independent perfect domination sets in Cayley graphs

✍ Jaeun Lee 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

Finding hidden hubs and dominating sets

Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries

✍ Peter Damaschke 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB