Scholarlink

The concept of graphs derived from coatoms of lattices is introduced. Two proper elements of a lattice are adjacent if their join is a coatom of a lattice. Some fundamental properties of these graphs such as cut vertex, diameter, planarity, and girth are studied. A condition is obtained under which these graphs are complete bipartite graphs. Some characterizations of such graphs are studied.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Graphs Derived from Coatoms of Lattices

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Rupal C. Shroff,
  • Pratibha S. Kshirsagar

摘要

The concept of graphs derived from coatoms of lattices is introduced. Two proper elements of a lattice are adjacent if their join is a coatom of a lattice. Some fundamental properties of these graphs such as cut vertex, diameter, planarity, and girth are studied. A condition is obtained under which these graphs are complete bipartite graphs. Some characterizations of such graphs are studied.