Graph algebra: Difference between revisions

Content deleted Content added
Sources corrected. Three concepts where graphs algebras have been used have been mentioned explicitly. There are more examples of uses (and references) which can be added to expand the article.
mNo edit summary
Line 1:
The concept of a graph algebra was introduced by G.F. McNulty and C.R. Shallon in [2]. Let <math>D=(V,E)</math> be a directed graph (see [[Graph (data structure)]]), and let <math>0</math> be an element not in <math>V</math>. The ''graph algebra'' associated with <math>D</math> is the set <math>V \cup \{0\}</math> equipped with multiplication defined by the rules <math>xy = x</math> if <math>x,y\in V,(x,y)\in E</math>, and <math>xy = 0</math> if <math>x,y\in V\cup \{0\},(x,y)\notin E</math>.
 
Graph algebras have been used in several directions of mathematics and computer science in constructions ofconcerning, variousfor examples concerningexample, dualities, varieties, finite state automata etc.
 
References