Functional Product of Graphs and Multiagent Systems

1
Sergio Ricardo P. de Mattos
Sergio Ricardo P. de Mattos
2
Abel Rodolfo Garcia Lozano
Abel Rodolfo Garcia Lozano
3
Angelo Santos Siqueira
Angelo Santos Siqueira
1 Department of Mathematics of ECELAH / UNIGRANRIO.

Send Message

To: Author

GJSFR Volume 17 Issue F8

Article Fingerprint

ReserarchID

560ST

Functional Product of Graphs and Multiagent Systems Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

14 Cites in Articles

References

  1. V Lesser (1999). Cooperative multiagent systems: a personal view of the state of the art.
  2. A Lozano,A Siqueira,S Mattos,S Jurkiewicz (2017). Functional product of graphs: basic ideas and some properties.
  3. Abel Lozano,Angelo Siqueira,Clícia Friedmann,Samuel Jurkiewicz (2016). RELATIONSHIP BETWEEN EQUITABLE TOTAL COLORING AND RANGE COLORING IN SOME REGULAR GRAPHS.
  4. Abel Lozano,Angelo Siqueira,Sergio Mattos,Samuel Jurkiewicz (2013). Produto Funcional de Grafos: Um Modelo para Conexão de Sistemas Multiagentes.
  5. Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard Karp,Scott Shenker (2001). A scalable content-addressable network.
  6. Luís Reis,Fernando Almeida,Luís Mota,Nuno Lau (2003). Coordination in Multi-robot Systems: Applications in Robotic Soccer.
  7. Antony Rowstron,Peter Druschel (2001). Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems.
  8. S Russel,P Norvig (2004). Artificial Intelligence: A Modern Approach.
  9. A Siqueira (2011). Coloração Total Equilibrada em Subfamilias de Grafos Regulares.
  10. Ion Stoica,Robert Morris,David Karger,M Kaashoek,Hari Balakrishnan (2001). Chord.
  11. K Sycara,M Paolucci,M Van Velsen,J Giampapa (2003). The retsinamas infrastructure.
  12. H Yap (1996). Total colorings of graphs.
  13. Z Zhang (2008). E-commerce based agents over p2p network. In Management of e-Commerce and e-Government.
  14. B Zhao,L Huang,J Stribling,S Rhea,A Joseph,J Kubiatowicz (2004). Tapestry: A Resilient Global-Scale Overlay for Service Deployment.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Sergio Ricardo P. de Mattos. 2017. \u201cFunctional Product of Graphs and Multiagent Systems\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 17 (GJSFR Volume 17 Issue F8): .

Download Citation

Issue Cover
GJSFR Volume 17 Issue F8
Pg. 15- 28
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification: MSC 2010: 05C50
Version of record

v1.2

Issue date

December 19, 2017

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 3103
Total Downloads: 1525
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Functional Product of Graphs and Multiagent Systems

Sergio Ricardo P. De Mattos
Sergio Ricardo P. De Mattos Department of Mathematics of ECELAH / UNIGRANRIO.
Abel Rodolfo Garcia Lozano
Abel Rodolfo Garcia Lozano
Angelo Santos Siqueira
Angelo Santos Siqueira

Research Journals