𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs determined by their finite induced subgraphs

✍ Scribed by H.D Macpherson

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
271 KB
Volume
41
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finite Induced Graph Ramsey Theory: On P
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
✍ D.S. Gunderson; V. Rodl; N.W. Sauer πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 425 KB

For given finite (unordered) graphs \(G\) and \(H\), we examine the existence of a Ramsey graph \(F\) for which the strong Ramsey arrow \(F \rightarrow(G)_{r}^{\prime \prime}\) holds. We concentrate on the situation when \(H\) is not a complete graph. The set of graphs \(G\) for which there exists a

Characterizing path graphs by forbidden
Characterizing path graphs by forbidden induced subgraphs
✍ Benjamin LΓ©vΓͺque; FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. Β© 2009

Some graphs determined by their spectra
Some graphs determined by their spectra
✍ Xiaoling Zhang; Heping Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 225 KB
Finite undirected graphs which are not r
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
✍ VΓ‘clav NΓ½dl πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 297 KB

Nydl, V., Finite undirected graphs which are not reconstructible from their large cardinality subgraphs, Discrete Mathematics 108 (1992) 373-377. For any integer n, and any real q, 0 < q < 1, we exhibit two nonisomorphic graphs on n > n,, vertices having the same collections of m-vertex subgraphs w

Which graphs are determined by their spe
Which graphs are determined by their spectrum?
✍ Edwin R. van Dam; Willem H. Haemers πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 242 KB

For almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered.