Volume : IV, Issue : V, May - 2015

A generic C++ Program for Finding Incident and Adjacent Matrices in Zero Divisor Graphs

Karan Pathak, Dr. J. Ravi Sankar

Abstract :

Zero divisor graphs are a family of frequently encountered optimization and enumeration graphs. Although they  are specific each for itself, theory provides a mathematical framework for treatment of graph structure and finding  the matrices for corresponding zero divisor graphs, in a general way. In this paper we describe a generic C++ liary based on algeaic approach for finding the adjacent and incident matrices for a zero divisor graph in single program. The classes and functions in the C++ program are very compact and written with the intention to be extensively combined. To use this program, we can find all the possible adjacent  and incident matrices of zero divisor graphs up to large value

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

Karan Pathak, Dr.J. Ravi Sankar A generic C++ Program for Finding Incident and Adjacent Matrices in Zero Divisor Graphs International Journal of Scientific Research, Vol : 4, Issue : 5 May 2015

Number of Downloads : 1326

References :