Abstract: This chapter introduces the basic characteristics and notions of graph theory and the science of networks: degree, degree distribution, clustering coefficient, the average length of the shortest path between two nodes in a network, the size of a giant connected component, and others. The classical random graphs and their characteristics are introduced and explained. The contrasting types of degree distributions are discussed: namely, Poisson and scale-free distributions.
Publication Year: 2003
Publication Date: 2003-01-16
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot