Edge domination in complete partite graphs
An edge dominating set in a graph \(G\) is a subset \(D\) of the edge set of \(G\) such that each edge of \(G\) either is in \(D\), or has a common end vertex with an edge of \(D\). The edges domatic number \(\text{ed}(G)\) of \(G\) is the maximum number of classes of a partition of the edge set of \(G\) into edge dominating subsets. In the paper the edge domatic number is studied for two classes of complete multipartite graphs. One of them is the class of graphs \(O^ t_ r\) which have \(t\) partition classes, each with \(r\) vertices. The other is the class of complete split graphs \(S(n,r)\) having one partition class with \(r\) vertices and \(n\) partition classes consisting of one vertex.
This page was built for publication: Edge domination in complete partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336647)
