First Sentence:
A graph X consists of a vertex set V(X) and an edge set E(X), where an edge is an unordered pair of distinct vertices of X.
Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
second subconstituent, eulerian partition, fractional colouring, closed eulerian walk, first subconstituent, fractional clique, thick vertices, double occurrence word, thick vertex, signed plane graphs, generalized line graph, fractional chromatic number, medial graph, equiangular lines, imperfect graph, minimum valency, orientable map, special hexagon, binary rank, strongly regular graph with parameters, eulerian tour, cubic planar graph, distinct nonadjacent vertices, unique generalized quadrangle, rank polynomial
Key Phrases - Capitalized Phrases (CAPs):
(learn more)
Theory Ser, Cambridge University Press, New York, Discrete Math, Academic Press, Linear Algebra Appl, Graphs Combin, John Wiley, Sons Inc
New!
Books on Related Topics |
Concordance
|
Text Stats
Browse Sample Pages:
Front Cover |
Table of Contents |
First Pages |
Index |
Back Cover |
Surprise Me!