Prime cordial labelling of graphs

MaRDI QIDQ3420829zbMATH OpenFDO

Authors M. Sundaram, R. Ponraj, S. Somasundram

Publication date 2 February 2007

zbMATH Keywords

complete graphcordial graphscycleladderpathprime graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6160003
• Prime and prime cordial labeling for some special graphs
• Prime cordial labeling on eccentric graph of cycle and path
• 4-prime cordial graphs obtained from 4-prime cordial graphs
• scientific article; zbMATH DE number 7442454

Cited in

(18)

• Prime labelings of infinite graphs
• Some new results on prime cordial labeling
• k-prime cordial graphs
• On the prime cordial labeling of generalized Petersen graph
• Prime and prime cordial labeling for some special graphs
• scientific article; zbMATH DE number 7008862 (Why is no real title available?)
• scientific article; zbMATH DE number 7009334 (Why is no real title available?)
• scientific article; zbMATH DE number 6160003 (Why is no real title available?)
• Prime cordial labeling of flower snark and related graphs.
• Prime Cordial Labeling For Some Graphs
• On prime labeling of some union graphs
• On cordial related labeling of isomorphic copies of paths and subdivision of star
• PRIME CORDIAL LABELING FOR SOME PATH, CYCLE AND WHEEL RELATED GRAPHS
• PRIME CORDIAL LABELING OF THE GRAPHS RELATED TO CYCLE WITH ONE CHORD, TWIN CHORDS AND TRIANGLE
• Prime cordial labeling on eccentric graph of cycle and path
• Coprime and prime labelings of graphs
• Prime labeling in the context of web graphs without center
• Power cordial graphs

This page was built for publication: Prime cordial labelling of graphs

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