The lightest totalization of an endnode labelling of a non-tree graph. I

MaRDI QIDQ2762301zbMATH OpenFDO

Authors Masazumi Hanazawa, Hiroshi Narushima

Publication date 8 January 2002

Published in Proceedings of the School of Science of Tokai University (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Review text

This first part (in Japanese) gives a partial answer to a problem fully answered in the second part [Proc. Sch. Sci. Tokai Univ. 35, 7-19 (2000; Zbl 0952.05063)] (in English).

Recommendations

• scientific article; zbMATH DE number 1506970
• Total mean cordial labeling of some cycle related graphs
• Edge colouring by total labellings
• scientific article; zbMATH DE number 1556747
• scientific article; zbMATH DE number 6831972

Cited in

(1)

• scientific article; zbMATH DE number 1506970 (Why is no real title available?)

This page was built for publication: The lightest totalization of an endnode labelling of a non-tree graph. I

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