Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Subjects
Graph theoryShowing 3 featured editions. View all 3 editions?
Edition | Availability |
---|---|
1
Topics in Graph Automorphisms and Reconstruction
2016, Cambridge University Press
in English
1316685306 9781316685303
|
zzzz
Libraries near you:
WorldCat
|
2
Topics in Graph Automorphisms and Reconstruction
2016, Cambridge University Press
in English
131666984X 9781316669846
|
zzzz
Libraries near you:
WorldCat
|
3
Topics in Graph Automorphisms and Reconstruction (London Mathematical Society Student Texts)
March 24, 2003, Cambridge University Press
Hardcover
in English
0521821517 9780521821513
|
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."
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 29, 2008
- 4 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
October 4, 2021 | Edited by ImportBot | import existing book |
August 19, 2020 | Edited by ImportBot | import existing book |
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 |