Edge Cover Domination in Mangoldt Graph

L Madhavi, B Maheswari
2011 Momona Ethiopian Journal of Science  
In their recent study of arithmetic graphs associated with certain arithmetic functions, the authors have introduced a new class of arithmetic graphs associated with Mangoldt function Λ(n), n ≥ 1, an integer and studied their basic properties and vertex cover. In this paper the edge cover, edge domination set, bondage number, non -bondage number and their parameters have been obtained for these graphs. way a subset of the edge E of G with minimum cordinality which covers every vertex of G plays
more » ... a crucial roll. These considerations lead to the concepts of vertex cover, vertex covering number, edge cover, edge covering number and other domination parameters of a graph, which constitute the domination theory of graphs. Domination theory of graphs has many applications in Engineering and Communication Networks. For these applications, the arithmetic graphs associated with certain number theoretic arithmetic functions like the Euler totient function Φ(n), the divison function d(n), the quadratic residue function and the Mangoldt function Λ(n), n ≥ 1, an integer come handy. These arithmetic graphs have been studied in detail by Madhavi (2003) .
doi:10.4314/mejs.v3i1.63683 fatcat:jzoudy6zy5fhljqldry3t6ocrq