Recursive contstructions of consecutively super-edge-magic trees

MaRDI QIDQ3512212zbMATH OpenFDO

Authors Yasuhiro Fukuchi, Akito Oshima

Publication date 11 July 2008

zbMATH Keywords

consecutive super-edge-magic labelingconsecutively super-edge-magic trees

Mathematics Subject Classification ID

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

Recommendations

• A recursive theorem for super-edge-magic labelings of trees
• On the construction of super edge-magic total graphs
• Super-edge-magic labelings of a family of trees with diameter 4
• Super-edge-magic labeling of trees with large diameter
• scientific article; zbMATH DE number 1269934

Cited in

(5)

• A recursive theorem for super-edge-magic labelings of trees
• Super-edge-magic labelings of a family of trees with diameter 4
• Embedding trees into super edge-magic trees
• Super-edge-magic labeling of trees with large diameter
• Any tree is a large subgraph of a magic tree

This page was built for publication: Recursive contstructions of consecutively super-edge-magic trees

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