• T.MURUGAN
• DR.N.SRINIVASAN

The concept of digraphs (or directed graphs) is one of the richest theories in graph theory, mainly because of their applications to physical problems. They are applied in abstract representations of computer programs and are an invaluable tools in the study of sequential machines. They are also used for systems analysis in control theory. Most of the concepts and terminology of undirected graphs are also applicable to digraphs, and hence in this chapter more emphasis will be given to those properties of digraphs that are not found in undirected graphs.

Reducibility of Eulerian Graphs and digraphs , Vertex Reducibility of Eulerian graph’s and Digraph, Edge Reducibility of Eulerian graphs and digraphs.

"REDUCIBILITY OF EULERIAN GRAPH AND DIGRAPHS ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.899-907, June 2019, Available :http://www.jetir.org/papers/JETIR1906U21.pdf

"REDUCIBILITY OF EULERIAN GRAPH AND DIGRAPHS ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp899-907, June 2019, Available at : http://www.jetir.org/papers/JETIR1906U21.pdf