Abstract
Some properties of the weak product of graphs on lattices are studied. We consider the weak product of the atom-based graphs, the incomparability graphs and the zero-divisor graphs of lattices. The number of edges in the weak product of such graphs is found. It is shown that the weak direct product of the atom-based graphs of two lattices [Formula: see text] and [Formula: see text] cannot be an induced subgraph of the atom-based graph of [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
