𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new upper bound for the isoperimetric number of deBruijn Networks

✍ Scribed by J. Bültermann

Book ID
104349987
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
226 KB
Volume
10
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for the harmonious chr
A new upper bound for the harmonious chromatic number
✍ Edwards, Keith 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

A new upper bound on the cyclic chromati
A new upper bound on the cyclic chromatic number
✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χ^__c__^. Let Δ^\*^ be the maximum face degree of a graph. There exist

A New Upper Bound on the Cheeger Number
A New Upper Bound on the Cheeger Number of a Graph
✍ Sorin Dragomir; Elisabetta Barletta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using a technique developed by A. Nilli (1991, Discrete Math. 91, 207 210), we estimate from above the Cheeger number of a finite connected graph G of small degree (2(G) 5) admitting sufficiently distant edges. ## 2001 Academic Press Let G=(V(G), E(G)) be a finite connected graph. The Cheeger numb