Directed Graphs representing isomorphism classes of C-Hypergroupoids

Authors

  • Antonios Kalampakas Department of Production Engineering and Management Laboratory of Computational Mathematics
  • Stefanos Spartalis School of Engineering, Democritus University of Thrace
  • Kassiani Skoulariki V.Sofias 12, Prokat, Building A1, 67100 Xanthi, Greece

Keywords:

Hyperoperations, Hypergroupoids, Directed Graphs.

Abstract

We investigate the relation of directed graphs and hyperstructures by virtue of the graph hyperoperation. A new class of graphs arises in this way representing isomorphism classes of C-hypergroupoids and we present the 17 such graphs that correspond to the 73 C-hypergroupoids associated with binary relations on three element sets. As it is shown they constitute an upper semilattice with respect to
graph inclusion.

References

N. Biggs, E. Lloyd and R. Wilson, Graph Theory, 1736-1936, Oxford University Press, 1986.

J.A. Bondy and U.S. Murty, Graph Theory, Springer, 2008.

S. Bozapalidis and A. Kalampakas, An axiomatization of graphs, Acta Informatica 41, (2004), 19-61.

S. Bozapalidis and A. Kalampakas, Graph Automata, Theoretical Com-puter Science 393, (2008), 147-165.

D. Bonchev and D.H. Rouvray (eds.), Chemical Graph Theory: Intro-duction and Fundamentals, Taylor & Francis, 1991.

I. Cristea and M. Stefanescu, Binary relations and reduced hypergroups, Discrete Mathematics 308, (2008), 3537-3544.

I. Cristea and M. Stefanescu, Hypergroups and n-ary relations, European Journal of Combinatorics 31, (2010), 780-789.

I. Cristea, M. Stefanescu and C. Anghluta, About the fundamental re-lations defined on the hypergroupoids associated with binary relations, European Journal of Combinatorics 32, (2011), 72-81.

P. Corsini, Binary relations and hypergroupoids, Italian Journal of Pure and Applied Mathematics 7, (2000), 11-18.

P. Corsini and V. Leoreanu, Hypergroups and binary relations, Algebra Universalis 43, (2000), 321-330.

P. Corsini and V. Leoreanu, Applications of Hyperstructure Theory,

Kluwer Academic Publishers, Boston, Dordrecht, London, 2002.

P. Corsini and V. Leoreanu, Survey on new topics of hyperstructure theory and its applications, Proc. of 8th Internat. Congress on AHA, (2003), 1-37.

F. Harary, Graph Theory, Reading, MA, Addison-Wesley, 1969.

M. Konstantinidou and K. Serafimidis, Sur les P-supertrillis, New Fron-tiers in Hyperstructures and Rel. Algebras, Hadronic Press, Palm Harbor U.S.A., (1996), 139-148.

Ch. Massouros and G. Massouros, Hypergroups Associated with Graphs and Automata, Proceedings of the International Conference on Numer-ical Analysis and Applied Mathematics, American Institute of Physics (AIP) Conference Proceedings, (1996), 164-167.

Ch. Massouros and Ch. Tsitouras, Enumeration of hypercompositional structures defined by binary relations, Italian Journal of Pure and Ap-plied Mathematics (to appear).

R. F. Mihalcea and D. R. Radev, Graph-based Natural Language Pro-cessing and Information Retrieval, Cambridge University Press, 2011.

I. Rosenberg, Hypergroups and Join Spaces determined by Relations, Italian Journal of Pure and Applied Mathematics 4, (1998), 93-101.

S. Spartalis, Hypergroupoids obtained from groupoids with binary rela-tions, Italian Journal of Pure and Applied Mathematics 16, (2004), 201-210.

S. Spartalis, The hyperoperation relation and the Corsini’s partial or not-partial hypergroupoids (A classification), Italian Journal of Pure and Applied Mathematics 24, (2008), 97-112.

S. Spartalis, M. Konstantinidou and A. Taouktsoglou, C-hypergroupoids obtained by special binary relations, Computers and Mathematics with Applications 59, (2010), 2628-2635.

S. Spartalis and C. Mamaloukas, On hyperstructures associated with binary relations, Computers and Mathematics with Applications 51, (2006), 41-50.

Downloads

Published

2012-12-18

Issue

Vol. 23 (2012)

Section

Volume 23-2012

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.