If the graph does not contain any cycles, its girth is defined to be infinity . For example, a 4-cycle (square) has girt...
Definitions 1.1 Graph 2 Types of graphs 2.1 Directed graph 2.2 Undirected graph 2.3 Finite graph 2.4 Simple graph 2.5 Re...
Circle graph - Wikipedia, the free encyclopedia Circle graph From Wikipedia, the free encyclopedia Jump to: navigation ,...
Hamiltonian path for any given pair of (distinct) endvertices is a Hamiltonian connected graph . A graph that contains a...
In a directed graph, one can distinguish the outdegree (number of outgoing edges) from the indegree (number of incoming ...
Many of the following properties follow immediately from the standard way in which line graphs translate properties abou...
Special cases of degree value 3.1 Isolated vertex 3.2 Leaf vertex 3.3 Regular graph 3.4 Source 3.5 Sink 3.6 Eulerian gra...
