# Adjacency Matrix

This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Directed or undirected graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents Weighted or unweighted graph. Actually This reads a text file & then checks the above condition. Change the path of the text file in code. Thanks.

This is a simple C source code written in gcc paltform (Ubuntu, Linux). It checks that how many Isolated vertices & pendent vertices are contained in the graph represented by the adjacency matrix. Isolated vertex has degree zero & pendent vertex has degree one. Hope it will help others. Thanks.

Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests that how many self-loop & parallel edges are contained in the graph represented by the adjacency matrix. Also it checks that which vertices contain only self-loop. Self-loop is an edge which has the same initial & termination point.

Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Symmetric graph or non-symmetric graph. Thanks.

Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Regular Graph or not. Basically a Regular graph is a graph, in which all vertices have equal degree. Let each & every vertex has degree x, then the graph is called as x-regular graph.

Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests whether the adjacency matrix represents a Complete Graph or not. Actually This reads a text file, Adjacency.txt & then checks the above condition. Please correct the path of Adjacency.txt in the code. Thanks.

This simple C source code is written in gcc paltform (Ubuntu, Linux). It tests whether the given adjacency matrix represents a Simple graph or not. Simple Graph is a graph that does not contain any parallel edge & self-loop. Thanks.

Hello, This is a simple C source code written in gcc paltform (Ubuntu, Linux). It tests the degree of all vertices along with the degree of graph from text file of adjacency matrix. Actually This reads a text file & then checks the above condition. Hope, It will help others. Thanks.