By Topic

Optimal domination in graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:22 ,  Issue: 11 )