Computing total edge product cordial labeling of circulant graphs.

zbMATH Open1488.05435MaRDI QIDQ4558669FDOQ4558669

Authors:

Publication date: 29 November 2018

Recommendations

• Computing \(3\)-total edge product cordial labeling of generalized Petersen graphs \(P(n,m)\).
• Total product cordial labeling of graphs
• Total edge product cordial labeling of graphs
• On \(k\)-total edge product cordial graphs
• 3-total edge product cordial labeling of complete, bipartite and generalized friendship graphs

zbMATH Keywords

circulant graphscordial labelingtotal edge product cordial labeling

Mathematics Subject Classification ID

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

Cited In (1)

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

This page was built for publication: Computing total edge product cordial labeling of circulant graphs.

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