On sum composite graphs and embedding problems

zbMATH Open1195.05067MaRDI QIDQ3565883FDOQ3565883

Authors T. M. K. Anandavally, S. Arumugam, K. A. Germina, S. B. Rao 

Publication date 7 June 2010

zbMATH Keywords

planar graphEulerian graphHamiltonian graphsum composite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Graph labelings, embedding and NP-completeness theorems
• scientific article; zbMATH DE number 4148140
• scientific article; zbMATH DE number 426164
• A Theorem on Sum Graphs
• A characterization of the sum and integral sum labellings of some classes of graphs

Cited In (2)

• Graph labelings, embedding and NP-completeness theorems
• The complement problem for linklessly embeddable graphs

This page was built for publication: On sum composite graphs and embedding problems

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