Computing 3-total edge product cordial labeling of generalized Petersen graphs P(n,m).

zbMATH Open1474.05345MaRDI QIDQ4568170FDOQ4568170

Authors: Ali Ahmad 

Publication date: 15 June 2018

Recommendations

• Computing total edge product cordial labeling of circulant graphs.
• On the prime cordial labeling of generalized Petersen graph
• scientific article; zbMATH DE number 2024677
• 3-total edge product cordial labeling of complete, bipartite and generalized friendship graphs
• Vertex-Magic Total Labelings Of Generalized Petersen Graphs

zbMATH Keywords

cordial labelinggeneralized Petersen graphstotal edge product cordial labeling

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Computing total edge product cordial labeling of circulant graphs.
• 3-TOTAL EDGE PRODUCT CORDIAL LABELING OF GRAPHS
• On 3-total edge product cordial labeling of grid
• Title not available (Why is that?)

This page was built for publication: Computing \(3\)-total edge product cordial labeling of generalized Petersen graphs \(P(n,m)\).

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