On the structure of minimum communication overlap networks

The author simplifies the formula for counting the communication overlap Q(G) of an arbitrary graph and illuminates the structure of the minimum communication overlap graphs. He also presents a new communication overlap index Q/sub q/(G), gives a formula for counting the values of this index in the case of an arbitrary graph, and describes the structure of graphs with minimum value Q/sub g/(G).<
>