I'm looking for a book with the description of basic types of graphs, terminology used in this field of Mathematics and main theorems. All in all, a good book to start with to be able to understand other more complicated works.
Diestel's book is not exactly light reading but it's thorough, current and really good. Also in the GTM series is Bollobas' book which is very good as well, and covers somewhat different ground with a different angle (Diestel emphasizes the forcing relationships between various invariants which is a nice unifying theme).
2) Ringel and Hartsfield's Pearl in Graph Theory is great, lovable and has lots of pictures and excellent exercises - ideal for an undergrad class that's not geared towards prepping students towards a grad course.
There are lots of terrific graph theory books now, most of which have been mentioned by the other posters so far. I would particularly agree with the recommendation of West; one of the most complete and well-written texts there are.
But to me, the most comprehensive and advanced text on graph theory is Graph Theory And Applications by Johnathan Gross and Jay Yellen. Crystal clear, great problems and contains probably the best chapter on topological graph theory there is in any source by 2 experts in the field. It's pricey, but well worth it.
And of course, anything by Bollobas is beautiful. The problem with Bollobas, though, is that it treats graph theory as pure mathematics while the books by Gross/Yellen and West have numerous applications. Like linear algebra, the applications of graph theory are nearly as important as its underlying theory.
I know only one book on graph theory, Wagner, Bodendieck "Graphentheorie". It contains detailed introductions of the basic concepts and theorems and independent chapters on interesting special topics, the 3dr vol. is independent and on games, many exercises.
Conveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra. The book covers graph algorithms, basic algebraic structures, coding theory and cryptography. It will be most suited for senior undergraduates and beginning graduate students in mathematics and computer science as also to
individuals who want to have a knowledge of the below-mentioned topics.
Presents a description of private key cryptosystems as also a discussion on public key cryptosystems such as RSA, ElGamal and Miller-Rabin. Finally, the Agrawal-KayalSaxena algorithm (AKS Algorithm) for testing if a given
positive integer is prime or not in polynomial time is presented- the first time in a textbook.