The L(2,1)-labeling on total graphs of complete multipartite graphs

zbMATH Open1224.05151MaRDI QIDQ3009237FDOQ3009237

Authors: Ruxandra Marinescu-Ghemeci, Gabriela Mihai 

Publication date: 23 June 2011

Full work available at URL: https://eudml.org/doc/226318

Recommendations

• scientific article; zbMATH DE number 5972537
• scientific article; zbMATH DE number 6940804
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• scientific article; zbMATH DE number 1185300

zbMATH Keywords

complete multipartite graphtotal graph\(L(2,1)\)-labeling

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (9)

• Title not available (Why is that?)
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
• An extremal problem on non-full colorable graphs
• Title not available (Why is that?)
• \(k\)-number of complete muti-partite graphs
• Title not available (Why is that?)
• On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs
• Title not available (Why is that?)

This page was built for publication: The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs

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