✦ LIBER ✦

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

✍ Scribed by Ying-Ying Tan; Yi-Zheng Fan

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 151 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.04.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The independence number of an edge-chrom

The independence number of an edge-chromatic critical graph

✍ Douglas R. Woodall 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB 👁 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro

Upper bounds on the edge clique cover nu

Upper bounds on the edge clique cover number of a graph

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 521 KB

The minimum number of triangles covering

The minimum number of triangles covering the edges of a graph

✍ Jenö Lehel 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 703 KB

The edge reconstruction number of a disc

The edge reconstruction number of a disconnected graph

✍ Robert Molina 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

An inequality involving the vertex arbor

An inequality involving the vertex arboricity and edge arboricity of a graph

✍ Stefan A. Burr 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB