Abstract
Tribonacci cubes Γn(3)are induced subgraphs of Qn, obtained by removing all the vertices that contain more than two consecutive 1’s. In the present work, we give some enumerative properties related to Γn(3). We show that the number of vertices of weight w in Γn(3)is ∑j=0n−w+1n−w+1jjw−j and express the number of edges of these graphs in terms of convolved Tribonacci numbers. We investigate the cube polynomials of Tribonacci cubes and determine the corresponding generating function. Finally, we give a formula for the number of induced k-cubes in Γn(3).
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.
