✦ LIBER ✦

Certain graph invariants do not distinguish all graphs

✍ Scribed by D. A. Chalcraft

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 193 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140307

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

This paper considers a certain fairly large class of graph invariants and shows that for any invariant in this class, there is a pair of nonisomorphic graphs that have the same invariant. Some explicit examples of such invariants are discussed.

📜 SIMILAR VOLUMES

On graphs and algebraic graphs that do n

On graphs and algebraic graphs that do not contain cycles of length 4

✍ Noga Alon; H. Tracy Hall; Christian Knauer; Rom Pinchasi; Raphael Yuster 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

We consider extremal problems for algebraic graphs, that is, graphs whose vertices correspond to vectors in R d , where two vectors are connected by an edge according to an algebraic condition. We also derive a lower bound on the rank of the adjacency matrix of a general abstract graph using the num