✦ LIBER ✦

On the isoperimetric number of a -degree Cayley graph

✍ Scribed by Zhantao Huang; Yinglie Jin; Ke Liang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 507 KB
Volume: 22
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.01.056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the k-degree Cayley graph

✍ Yuuki Tanaka; Yukio Shibata 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The minimum order of a cayley graph with

The minimum order of a cayley graph with given degree and diameter

✍ Yahya Ould Hamidoune 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

The irredundance number and maximum degr

The irredundance number and maximum degree of a graph

✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

On the connectivity of cayley graphs

✍ Wilfried Imrich 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 282 KB

On an upper bound of a graph's chromatic

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

✍ O.V Borodin; A.V Kostochka 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 159 KB