Two upper bounds of prime cordial graphs

MaRDI QIDQ3003878zbMATH OpenFDO

Authors M. A. Seoud, M. A. Salim

Publication date 31 May 2011

zbMATH Keywords

bipartite graphs

Mathematics Subject Classification ID

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

Recommendations

• Prime cordial and 3-equitable prime cordial graphs
• Upper bounds of four types of graph labelings.
• scientific article; zbMATH DE number 6160003
• On prime cordial labeling of graphs
• scientific article; zbMATH DE number 6160280

Cited in

(6)

• k-prime cordial graphs
• Upper bounds of four types of graph labelings.
• scientific article; zbMATH DE number 7008862 (Why is no real title available?)
• scientific article; zbMATH DE number 6160280 (Why is no real title available?)
• Prime cordial and 3-equitable prime cordial graphs
• Pair mean cordial labeling of udukkai, octopus, drum and fire cracker graphs

This page was built for publication: Two upper bounds of prime cordial graphs

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