A note on simple graphic algebras | Zendy

Nieminen Juhani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A note on simple graphic algebras

Author(s) -

Nieminen Juhani

Publication year - 1975

Publication title -

mathematical logic quarterly

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.473

H-Index - 28

eISSN - 1521-3870

pISSN - 0942-5616

DOI - 10.1002/malq.19750210147

Subject(s) - distributive property , simple (philosophy) , relation (database) , citation , mathematics , computer science , verb , combinatorics , algebra over a field , information retrieval , library science , artificial intelligence , philosophy , pure mathematics , epistemology , database

111 troduction Several authors have studied the structure of algebras with a ternary operation called median operation, scc e.g. [I ] , [2], [3], [4], and [7]. Most of the authors have concentrated on the lattice and tree structures while I,. NEBESKG has extended the study to contain a class of undirected, finite graphs [5 ] , [6]. I n this note we shall formulate Home conditions giving a criterion for a class of graphs, called by L. NEBESKG median graphs. 1. Some basic concepts and notations In this note we shall use thc concepts defined by L. NEBESKY in [5 ] . An ordered pair ( V , &) is a graphic algebra, if V is a non-empty set and Q a closed ternary operation on V such that for every a, b, c E V

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research