Abstract
Graph theoretic techniques provide a convenient tool for the investigation of communication networks. Here a communication network is represented by a nonoriented linear graph, in which the edges represent communication links and the vertices represent cities. A transmitting group is a set of cities which, acting as transmitting stations, can transmit messages to every city in the network. Stated graph theoretically, a transmitting group is a dominating set, i.e., a set of vertices D having the property that any vertex not in D is adjacent to at least one vertex in D . The problem of finding disjoint dominating sets in a graph is studied, in particular, the domatic number d(G) of a graph G is defined as the maximum order of a partition of the vertices of G into dominating sets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
