Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Order Structure of Good Sets in Hypercube

N. V. Shinde1, Sandhya A. Tapadia2, B. N. Waphare3
1Department of Mathematics, COEP Technological University, Pune-411005, India.
2Department of Engineering Sciences, Vishwakarma University, Pune-411048, India.
3Center for Advanced Studies in Mathematics, Department of Mathematics, Savitribai Phule Pune University, Pune-411007, India.
  • Received: 20/09/2023
  • Accepted: 09/11/2023
  • Published: 14/11/2023

Abstract

A good set on \(k\) vertices is a vertex induced subgraph of the hypercube \(Q_n\) that has the maximum number of edges. The long-lasting problem of characterizing graphs that are cover graphs of lattices is NP-complete. This paper constructs and studies lattice theoretic properties of a class of lattices whose cover graphs are isomorphic to good sets.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
N. V. Shinde, Sandhya A. Tapadia, B. N. Waphare. Order Structure of Good Sets in Hypercube[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 117. 47-54. DOI: https://doi.org/10.61091/jcmcc117-05.