𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection numbers for coherent configurations and the spectrum of a graph

✍ Scribed by Colin D Walter

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
202 KB
Volume
35
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds for the ramsey number of a discon
Bounds for the ramsey number of a disconnected graph versus any graph
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 200 KB πŸ‘ 1 views

## Abstract Bounds are determined for the Ramsey number of the union of graphs versus a fixed graph __H__, based on the Ramsey number of the components versus __H__. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In p

Bounds for the harmonious chromatic numb
Bounds for the harmonious chromatic number of a graph
✍ I. Krasikov; Y. Roditty πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 231 KB πŸ‘ 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number
Improved bounds for the chromatic number of a graph
✍ S. Louis Hakimi; Edward Schmeichel πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_