Vertex coloring − A way of coloring the vertices of a graph so that no two adjacent vertices share the same color.Įdge Coloring − It is the method of assigning a color to each edge so that no two adjacent edges have the same color.įace coloring − It assigns a color to each face or region of a planar graph so that no two faces that share a common boundary have the same color.Ĭhromatic number is the minimum number of colors required to color a graph. Graph coloring is a method to assign colors to the vertices of a graph so that no two adjacent vertices have the same color. Undirected graph − In an undirected graph, edges have no direction. Vertices are also known as nodes.Įdges − Edges are the links that connect the vertices.ĭirected graph − In a directed graph, edges have direction, i.e., edges go from one vertex to another. Vertices − Interconnected objects in a graph are called vertices. ![]() A graph is an abstract notation used to represent the connection between pairs of objects.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |