Definition (Sparse Graph) A sparse graph is a graph in which .
For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fixed constant k. Graph G is a sparse graph because .
A graph that is not sparse is said to be dense:
Definition (Dense Graph) A dense graph is a graph in which .
For example, consider a graph with n nodes. Suppose that the out-degree of each vertex in G is some fraction fof n, . E.g., if n=16 and f=0.25, the out-degree of each node is 4. Graph G is a dense graph because .
Chat with our AI personalities
The comparative form of sparse is sparser
sparsest
A sparse matrix is matrix that allows special techniques to take advantage of large number of zero element. Application of sparse matrix is classification and relationship analysis in large data base system - SPARCOM
the five graph is line graph,bar graph,pictograph,pie graph and coin graph
bar graph,line graph and pie graph