Abstract
Abstract A k-pseudosnake in a graph is an induced subgraph of maximum degree at most k. In this paper we show that k-pseudosnakes with more than 2 n − 1 vertices exist in the hypercubes Q n , provided n ⩽ 2 k . We also give upper bounds, and show that the generated k-pseudosnakes are maximum provided k is even and n = 3 k / 2 . The results also yield better constructions of k-pseudosnakes in large n-dimensional grids in certain cases.
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.
