Larger graceful and interlaced lobsters obtained by joining smaller ones

MaRDI QIDQ600378zbMATH OpenFDO

Authors Pratima Panigrahi, Debdas Mishra

Publication date 5 November 2010

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

graceful labelingcaterpillarlobsterinterlaced labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 5844248
• Some graceful lobsters with both odd and even degree vertices on the central path
• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
• Some new classes of graceful lobsters obtained from diameter four trees

This page was built for publication: Larger graceful and interlaced lobsters obtained by joining smaller ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600378)