1978
DOI: 10.4064/cm-40-1-23-29
|View full text |Cite
|
Sign up to set email alerts
|

The ideal structure of simple ternary algebras

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

1981
1981
2019
2019

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 0 publications
0
10
0
Order By: Relevance
“…A further study about extensions and generalizations will be the topic of a subsequent paper. We close this section by The elements of Csub (S) are convex subtrees of S. In Theorem 4 of [7] it is shown that these constitute a median semilattice, which is a distributive Z~b-lattice as stated above.…”
Section: =(A]a((b]v(c])<=((a]a(b])v((a]a(c])=((aab)v(aac)]mentioning
confidence: 99%
“…A further study about extensions and generalizations will be the topic of a subsequent paper. We close this section by The elements of Csub (S) are convex subtrees of S. In Theorem 4 of [7] it is shown that these constitute a median semilattice, which is a distributive Z~b-lattice as stated above.…”
Section: =(A]a((b]v(c])<=((a]a(b])v((a]a(c])=((aab)v(aac)]mentioning
confidence: 99%
“…Consider a star of five points v 1 , v 2 , v 3 , v 4 , v 5 with v 4 as a middle point, join to this star a path v 5 v 6 v 7 v 8 , and denote the tree thus obtained by T. The tree T shows that one of the two points of a centroid need not be a least L-eccentricity point of a tree: In T, the centroid is {v 4 …”
Section: Theorem 6 At Least One Of the Points Y In The Centroid Of Amentioning
confidence: 99%
“…A tree may contain several central subtrees. This can be seen by considering a path of six points: e L (͗{v 3 4 shows that there may be several least central subtrees in a tree: e L (͗{v 3 …”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The joinsemilattice of subtrees was introduced in [11]; see also [10]. The underlying graph G L is a median graph [1,7,9].…”
Section: Introductionmentioning
confidence: 99%