A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On the Connected End Equitable Domination of Graphs
2016
International Journal of Scientific and Innovative Mathematical Research
A set of vertices in a graph is a connected dominating set if every vertex not in is adjacent to some vertex in and the subgraph induced by is connected. The connected domination number is the minimum size of such a set. An equitable dominating set in a graph is called connected equitable dominating set in the subgraph induced by is connected. In this paper we introduce the connected end equitable domination of graphs. The values of this concept are found for some important families of graphs
doi:10.20431/2347-3142.0403007
fatcat:hpuedlmtgrgurl7zkzw2ubd4dy