GRAPH WITH RESPECT TO SUPERFLUOUS ELEMENTS IN A LATTICE

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We consider superfluous elements in a bounded lattice with 0 and 1, and introduce various types of graphs associated with these elements. The notions such as superfluous element graph (S(L)), join intersection graph (JI(L)) in a lattice, and in a distributive lattice, superfluous intersection graph (SI(L)) are defined. Dual atoms play an important role to find connections between the lattice-theoretic properties and those of corresponding graph-theoretic properties. Consequently, we derive some important equivalent conditions of graphs involving the cardinality of dual atoms in a lattice. We provide necessary illustrations and investigate properties such as diameter, girth, and cut vertex of these graphs.

Original languageEnglish
Pages (from-to)929-945
Number of pages17
JournalMiskolc Mathematical Notes
Volume23
Issue number2
DOIs
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

  • Analysis
  • Algebra and Number Theory
  • Numerical Analysis
  • Discrete Mathematics and Combinatorics
  • Control and Optimization

Fingerprint

Dive into the research topics of 'GRAPH WITH RESPECT TO SUPERFLUOUS ELEMENTS IN A LATTICE'. Together they form a unique fingerprint.

Cite this