Basic Graph Theory pp 1-9 | Cite as

# Graphs and Their Applications

Chapter

First Online:

## Abstract

A graph consists of a set of vertices and set of edges, each joining two vertices. Usually an object can be represented by a vertex and a relationship between two objects is represented by an edge. In this chapter we go through some applications of graphs in solving real-world problems.

## References

- 1.Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory: 1736–1936. Oxford University Press, Oxford (1976)Google Scholar
- 2.Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier Science Ltd/North-Holland, New York (1976)Google Scholar
- 3.Gross, J.L., Yellen, J.: Graph Theory and Its Applications, 2nd edn. Chapman and Hall, London (2005)Google Scholar
- 4.Appel, K., Haken, W.: Every map is four colourable. Bull. Am. Math. Soc.
**82**, 711–712 (1976)Google Scholar - 5.Calamoneri, T., Massini, A., Török, L., Vrt’o, I.: Antibandwidth of complete k-ary trees. Discret. Math.
**309**(22), 6408–6414 (2009)Google Scholar - 6.Patwary, M.M.A., Rahman, M.S.: Minimum face-spanning subgraphs of plane graphs. AKCE J. Graphs. Combin.
**7**(2), 133–150 (2010)MathSciNetzbMATHGoogle Scholar - 7.Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)CrossRefzbMATHGoogle Scholar
- 8.Porter, M.A., Onnela, J.-P., Mucha, P.J.: Communities in networks. Not. Amer. Math. Soc.
**56**, 1082–1097, 1164–1166 (2009)Google Scholar - 9.Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection, in IEEE Trans. Knowl. Data Eng.
**24**(7), 1216–1230 (2012). doi: 10.1109/TKDE.2010.271 - 10.Sung, W.: Algorithms in Bioinformatics. CRC Press, London (2010)zbMATHGoogle Scholar
- 11.Mall, R.: Fundamentals of Software Engineering, 4th edn. Prentice-Hall of India Pvt. Ltd. (2014)Google Scholar

## Copyright information

© Springer International Publishing AG 2017