Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: Undetermined
Showing 3 featured editions. View all 3 editions?
Edition | Availability |
---|---|
1
Topics in Graph Automorphisms and Reconstruction
2016, Cambridge University Press
in English
1316610446 9781316610442
|
zzzz
Libraries near you:
WorldCat
|
2
TOPICS IN GRAPH AUTOMORPHISMS AND RECONSTRUCTION.
2003, CAMBRIDGE UNIV PRESS
in Undetermined
0521529034 9780521529037
|
cccc
Libraries near you:
WorldCat
|
3
Topics in Graph Automorphisms and Reconstruction (London Mathematical Society Student Texts)
March 17, 2003, Cambridge University Press
Paperback
in English
0521529034 9780521529037
|
aaaa
Libraries near you:
WorldCat
|
Book Details
First Sentence
"In these chapters a graph G = (V(G), E(G)) will consist of two disjoint sets: a nonempty set V = V(G) whose elements will be called vertices and a set E = E(G) whose elements, called edges, will be unordered pairs of distinct elements of V."
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 29, 2008
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
May 30, 2019 | Edited by MARC Bot | associate 1 edition with work |
April 14, 2010 | Edited by Open Library Bot | Linked existing covers to the edition. |
April 29, 2008 | Created by an anonymous user | Imported from amazon.com record. |