✦ LIBER ✦

The Gewirtz Graph: An Exercise in the Theory of Graph Spectra

✍ Scribed by A.E. Brouwer; W.H. Haemers

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 380 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every Graph Is an Integral Distance Grap

Every Graph Is an Integral Distance Graph in the Plane

✍ Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.

The graph theory bibliography of paul tu

The graph theory bibliography of paul turán

📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB

An investigation of the coauthor graph

✍ Logan, Elisabeth L. ;Shaw, W. M. 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 737 KB

The structure of coauthor graphs and the statistical validity of the associated author partitions are investigated as a function of productivity and collaborative thresholds. The productivity threshold determines the number of authors (points) in a coauthor graph, and the collaborative threshold det

ChemInform Abstract: The Concept of Grap

ChemInform Abstract: The Concept of Graph Mass in Molecular Graph Theory. A Case in Data Reduction Analysis

✍ Lionello Pogliani 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 25 KB 👁 1 views

## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable v

The Spectra of Complementary Subgraphs i

The Spectra of Complementary Subgraphs in a Strongly Regular Graph

✍ D. de Caen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 117 KB

On the Nash-Williams′ Lemma in Graph Rec

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

✍ B.D. Thatte 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A generalization of Nash-Williams' lemma is proved for the structure of \(m\)-uniform null ( \(m-k\) )-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tourn