Browsing JAEM 2020, Vol 10, No 1 by Subject "Brick product graph"
Now showing items 1-1 of 1
-
Edge domination in some brick product graphs
(Işık University Press, 2020)Let G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E ? F is adjacent to at least one edge in F. The edge domination number ?? (G) of G is ...