Graph Automata and Graph Colorability

Authors

  • Antonios Kalampakas AUM

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4629

Keywords:

Graph Colorability, Graph Theory

Abstract

Automata recognizing graphs can be constructed by employing the algebraic structure of graphoids. For the construction of a graph automaton, the relations over the Kleene star of the state set must constitute a graphoid. Hence different kinds of graphoids produce graph automata with diverse operation and recognition capacity. In this paper we show that graph colorability is recognized by automata operating over the simplest possible abelian graphoid.

Downloads

Published

2023-01-29

How to Cite

Kalampakas, A. (2023). Graph Automata and Graph Colorability. European Journal of Pure and Applied Mathematics, 16(1), 112–120. https://doi.org/10.29020/nybg.ejpam.v16i1.4629

Issue

Vol. 16 No. 1: (January 2023)

Section

Nonlinear Analysis

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.

Most read articles by the same author(s)