Abstract
By defining new concepts like pseudocomplements in graphs a new class of graphs is obtained. They have very many properties in common with hypercubes and therefore they are called pseudocubes. Pseudocubes are Hasse diagram graphs (covering garphs) of finite lattices, where pseucomplements constitute a sublattice. As an application, the routing and fault tolerance properties of certain pseudocubes are determined.
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.
