Title of article :
On asymmetric communication protocols
Author/Authors :
Laber، نويسنده , , Eduardo Sany and Holanda، نويسنده , , Leonardo Gomes، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
The clique graph K(G) of a graph G is the intersection graph of the cliques of G. If G ≌ K(G) then G is a self-clique graph. We describe a sufficient condition for a graph to be self-clique.
Keywords :
Wireless networking , communication protocols , Key words: Asymmetric Communication , Data Compression
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
