I am reading a paper which is regarding to the graph theory.
It is applied theory to computer science.
My background was industrial and management engineering, and computer science and engineering right now.
I am freshman at a grad school. Maybe because of the reason, I don't fully understand and know about graph theory.
By the paper's author, the density of a graph seems like
(density) = (the number of edges) / (the number of nodes)
The authors followed E. Lawler (1976), Combinatorial Optimization: Networks and Matroids.
And they recommeded to see chapter 4 of that book.
I can't find about the density at the book.
So I searched google, maybe people say the density of a graph is
(density) = (the number of edges) / (the number of possible edges)
Those two definitions are different.
I would like to make it sure.
Thank you for your help in advance.