✦ LIBER ✦

A note on construction of upper bound graphs

✍ Scribed by Hiroshi Era; Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiyao

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 293 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00072-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the construction of marked gra

A note on the construction of marked graphs

✍ K. Thirusangu; K. Rangarajan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On upper bounds for Laplacian graph eige

On upper bounds for Laplacian graph eigenvalues

✍ Dongmei Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 150 KB

A note on upper bounds on the cp-rank

✍ Naomi Shaked-Monderer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The Order Upper Bound on Parity Embeddin

The Order Upper Bound on Parity Embedding of a Graph

✍ Thomas Zaslavsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is the Euler characteristic) over all surfaces S in which 1 can be parity embedde

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

A note on upper bounds for some Ramsey n

A note on upper bounds for some Ramsey numbers

✍ Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.