Abstract
In this chapter, we learn some definitions of basic graph theoretic terminologies and know some preliminary results of graph theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Karim, M.R., Rahman, M.S.: On a class of planar graphs with straight-line grid drawings on linear area. J. Graph Algorithms Appl. 13(2), 153–177 (2009)
Koshy, T.: Discrete Mathematics with Applications. Elsevier, Amsterdam (2004)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2001)
Havel, V.: A remark on the existence of finite graphs [Czec] Casopis. Pest. Mat. 80, 477–480 (1955)
Hakimi, S.L.: On realizability of a set of integers as degrees of vertices of a linear graph. SIAM J. Appl. Math. 10, 496–506 (1962)
Nishizeki, T., Rahman, M.S.: Planar graph drawing. World Scientific, Singapore (2004)
Wilson, R.J.: Introduction to Graph Theory, 4th edn. Longman, London (1996)
Clark, J., Holton, D.A.: A First Look at Graph Theory. World Scientific, Singapore (1991)
Pirzada, S.: An Introduction to Graph Theory. University Press, India (2009)
Author information
Authors and Affiliations
Corresponding author
Exercises
Exercises
-
1.
Show that every regular graph with an odd degree has an even number of vertices.
-
2.
Construct the complement of \(K_{3,3}\), \(W_5\), and \(C_5\).
-
3.
Can you construct a disconnected graph G of two or more vertices such that \(\overline{G}\) is also disconnected. Give a proof supporting your answer.
-
4.
Give two examples of self-complementary graphs.
-
5.
What is the necessary and sufficient condition for \(K_{m,n}\) to be a regular graph?
-
6.
Is there a simple graph of n vertices such that the vertices all have distinct degrees? Give a proof supporting your answer.
-
7.
Draw the graph \(G=(V,E)\) with vertex set \(V=\{a,b,c,d,e,f,g,h\}\) and edge set \(\{(a,b), (a,e), (b,c), (b,d), (c,d), (c,g), (d,e) (e,f), (f,g), (f,h), (g,h)\}\). Draw \(G-(d,e)\). Draw the subgraph of G induced by \(\{c,d,e,f\}\). Contract the edge (d, e) from G.
-
8.
Show that two graphs are isomorphic if and only if their complements are isomorphic.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Rahman, M.S. (2017). Basic Graph Terminologies. In: Basic Graph Theory. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-49475-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-49475-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49474-6
Online ISBN: 978-3-319-49475-3
eBook Packages: Computer ScienceComputer Science (R0)