Previous Page 9

Displaying 161 – 171 of 171

Showing per page

When a line graph associated to annihilating-ideal graph of a lattice is planar or projective

Atossa Parsapour, Khadijeh Ahmad Javaheri (2018)

Czechoslovak Mathematical Journal

Let ( L , , ) be a finite lattice with a least element 0. 𝔸 G ( L ) is an annihilating-ideal graph of L in which the vertex set is the set of all nontrivial ideals of L , and two distinct vertices I and J are adjacent if and only if I J = 0 . We completely characterize all finite lattices L whose line graph associated to an annihilating-ideal graph, denoted by 𝔏 ( 𝔸 G ( L ) ) , is a planar or projective graph.

δ -ideals in pseudo-complemented distributive lattices

M. Sambasiva Rao (2012)

Archivum Mathematicum

The concept of δ -ideals is introduced in a pseudo-complemented distributive lattice and some properties of these ideals are studied. Stone lattices are characterized in terms of δ -ideals. A set of equivalent conditions is obtained to characterize a Boolean algebra in terms of δ -ideals. Finally, some properties of δ -ideals are studied with respect to homomorphisms and filter congruences.

λ -lattices

Václav Snášel (1997)

Mathematica Bohemica

In this paper, we generalize the notion of supremum and infimum in a poset.

Σ -isomorphic algebraic structures

Ivan Chajda, Petr Emanovský (1995)

Mathematica Bohemica

For an algebraic structure = ( A , F , R ) or type and a set Σ of open formulas of the first order language L ( ) we introduce the concept of Σ -closed subsets of . The set Σ ( ) of all Σ -closed subsets forms a complete lattice. Algebraic structures , of type are called Σ -isomorphic if Σ ( ) Σ ( ) . Examples of such Σ -closed subsets are e.g. subalgebras of an algebra, ideals of a ring, ideals of a lattice, convex subsets of an ordered or quasiordered set etc. We study Σ -isomorphic algebraic structures in dependence on the...

Currently displaying 161 – 171 of 171

Previous Page 9