Warning:
JavaScript is turned OFF. None of the links on this page will work until it is reactivated.
If you need help turning JavaScript On, click here.
This Concept Map, created with IHMC CmapTools, has information related to: Graph Types, Weighted graph define Weight of graph = sum of all edges weight, Directed graph/ digraph G :=(V,A) compose of Arc/directed edge,arrows A, Type of Graph define as Weighted graph, Multi graph when Multiple edges are allowed, Mixed graph G := (V, E, A) contains undirected edges and directed edges, Complete graph when All vertices are link to each others, Type of Graph define as Finite graph, Finite graph are finite set E(G), Directed graph/ digraph G :=(V,A) is an Oriented graph, Type of Graph define as Undirected graph/Graph G := (V,E), Directed graph/ digraph G :=(V,A) compose of Vertices/Nodes V, Type of Graph define as Regular graph, Directed graph/ digraph G :=(V,A) is a Symetric graph, Type of Graph define as Complete graph, Simple graph when No self loop, Weighted graph when Edges has weight, costs, length, etc., Simple graph when 1 edge between each vertices, Type of Graph define as Mixed graph G := (V, E, A), Regular graph when Each vertices has the same number of edges Each vertices as the same degree (k) k-regular graph = a graph of degree k, Symetric graph if A and inverted A belong to G