<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Concept lattices are an ordering of the maximal rectangles defined by a binary relation. This paper, using the idea of neighbor sets in graph theory, presents an approach to obtain all the concepts for a context, and simultaneously gets the diagram of the concept lattice.</p></abstract>

Concept lattices are an ordering of the maximal rectangles defined by a binary relation. This paper, using the idea of neighbor sets in graph theory, presents an approach to obtain all the concepts for a context, and simultaneously gets the diagram of the concept lattice.

Representing a Concept Lattice by Neighborly Ideas

Department of Mathematics, Hebei University, Baoding 071002, China

Annals of West University of Timisoara - Mathematics and Computer Science

{"article-title":"Representing a Concept Lattice by Neighborly Ideas"}

Concept lattices are an ordering of the maximal rectangles defined by a binary relation. This paper, using the idea of neighbor sets in graph theory, presents...

Representing a Concept Lattice by Neighborly Ideas

Publicado en línea: 22 nov 2012

Páginas: 77 - 82

DOI: https://doi.org/10.2478/v10324-012-0006-3

Palabras clave
Concept lattice, graph, neighbor, cover, co-height

This content is open access.

Representing a Concept Lattice by Neighborly Ideas

Publicado en línea: 22 nov 2012

Páginas: 77 - 82

DOI: https://doi.org/10.2478/v10324-012-0006-3

Palabras claveConcept lattice, graph, neighbor, cover, co-height

This content is open access.

Palabras clave
Concept lattice, graph, neighbor, cover, co-height