ABSTRACT.
In this work, concepts the functional product of graphs and total equitable coloring were used to propose a connection model of multi-agent systems. We show how generate a family of regular graphs that allows vertex coloring handily Δ with Δ+1 colors, called harmonics graphs. This result shows that these graphs have a scalable and recursive structure because from an initial basic instance, you can dynamically expand their form, keeping properties such as connectivity and regularity. Finally, we present a connection model of between multiagent system (MAS), using the harmonics graphs as support of construction of network topologies overly P2P for communication between these systems.
Keywords:
functional product of graphs; harmonics graphs; multi-agent systems
