✦ LIBER ✦

Lower bound for the norm of a vertex-transitive graph

✍ Scribed by William L. Paschke

Publisher: Springer-Verlag
Year: 1993
Tongue: French
Weight: 767 KB
Volume: 213
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf03025720

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o

A Lower Bound for the Norm of the Minima

A Lower Bound for the Norm of the Minimal Residual Polynomial

✍ Klaus Schiefermayr 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 348 KB

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB

A lower bound for the convexity number o

A lower bound for the convexity number of some graphs

✍ Byung Kee Kim 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A lower bound on the independence number

A lower bound on the independence number of a graph

✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

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