International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 60 - Number 11 |
Year of Publication: 2012 |
Authors: S. Uma Maheswari, B. Maheswari, M. Manjuri |
10.5120/9735-3818 |
S. Uma Maheswari, B. Maheswari, M. Manjuri . Matching Dominating Sets of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs. International Journal of Computer Applications. 60, 11 ( December 2012), 11-16. DOI=10.5120/9735-3818
Graph Theory is one of the most flourishing branches of modern Mathematics finding widest applications in all most all branches of Science & Technology. It is applied in diverse areas such as social sciences, linguistics, physical sciences, communication engineering etc. Number Theory is one of the oldest branches of Mathematics, which inherited rich contributions from almost all greatest mathematicians, ancient and modern. Every branch of mathematics employs some notion of a product that enables the combination or decomposition of its elemental structures. Product of graphs are introduced in Graph Theory very recently and developing rapidly. In this paper, we consider direct product graphs of Cayley graphs with Arithmetic graphs and present Matching dominating set of these graphs.