Concept explainers
In Exercises22-24 draw the graph represented by the given adjacency matrix.
The density of an undirected graph G is the number of edges of G divided by the number of possible edges in an undirected graph with | G| vertices, Consequent, the density of G(V,E) is
A family of graphs Gn, n = 1, 2,... issparseif the limit of the density of Gnis zero as n grows without bound, while it is dense if this proportion approaches a positive real number. As mentioned in the text, an individual graph is called sparse when it contains relatively few edges and dense if it contains many edges. These terms can be defined precisely depending on the contest, but different definitions generally will not agree.
Want to see the full answer?
Check out a sample textbook solutionChapter 10 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage