Functional Product of Graphs and Multiagent Systems
Keywords:
functional product of graphs, harmonics graphs, multiagent system
Abstract
In this work, the concepts of functional product of graphs and equitable total coloring were used to propose a model of connection among the multiagent systems. We show how to generate a family of regular graphs that admits a range vertex coloringof order ? with ? + 1 colors, denominated harmonic graphs. We prove that the harmonic graphs do not have cut vertices. We also show that the concept of equitable total coloring can be used to elaborate parallel algorithms that are independent of the network topology. Finally, we show a model of connection among multiagent systems (MAS) based on the use of harmonic graphs as a support for the construction of P2P overlay network topologies used for the communication among these systems.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2017-05-15
Issue
Section
License
Copyright (c) 2017 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.