Accurate Connected Edge Domination Number in Graphs.

Autor: GOUDAR, VENKANAGOUDA M., S. H., VENKATESH, VENKATESHA, K. M., TEJASWINI
Předmět:
Zdroj: Journal of Ultra Scientist of Physical Sciences - Section A (Mathematics); 2017, Vol. 29 Issue 7, p290-301, 12p
Abstrakt: An accurate edge dominating set D of a graph G = (V,E) is an accurate connected edge dominating set, if < D > is connected. The accurate connected edge domination number γcae (G) is the minimum cardinality of an accurate connected edge dominating set. In this paper, we initiate a study of γcae (G) in terms of vertices, edges, cut vertices and different parameters of G . Further we characterize the accurate connected edge domination number in cartesian product and corona of graphs. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index