This survey provides a comprehensive and unified analysis of symmetry in a wide variety of
Cayley graphs of permutation groups. These include the star graph, bubble-sort graph …

Given an undirected graph representing a network of processors, and a source node
containing a message that must be broadcast to all the nodes, find a scheme that …

In heterogeneous networks sending messages may incur different delays on different edges,
and each processor may have a different switching time between messages. The well …

Broadcasting is the process of information dissemination in a network in which a sender,
called the originator, wishes to inform all network members as promptly as possible. The …

Knödel graphs of even order n and degree 1⩽ Δ⩽⌊ log2 (n)⌋, WΔ, n, are graphs which
have been introduced some 25 years ago as the topology underlying a time optimal …

Broadcasting is an information dissemination process in which a message is to be sent from
a single originator to all members of a network by placing calls over the communication lines …

Broadcasting is an information dissemination problem in which information originating at
one node of a communication network (modeled as a graph) must be transmitted to all other …

In heterogeneous networks, sending messages may incur different delays on different links,
and each node may have a different switching time between messages. The well-studied …

Given a graph G=(V, E) and a vertex u∈ V, broadcasting is the process of disseminating a
piece of information from vertex u to every other vertex in the graph where, in each time unit …

A minimum broadcast graph on 63 vertices+ Page 1 DISCRETE APPLIED MATHEMATICS
ELSWIER Discrete Applied Mathematics 53 (1994) 247-250 A minimum broadcast graph on 63 …