Cordial labeling of \(mK_ n\)

DOI10.1016/S0012-365X(95)00336-UzbMath0873.05073OpenAlexW2088810078MaRDI QIDQ1357726

O. Diekmann

Publication date: 20 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(95)00336-u

zbMATH Keywords

diophantine equationgraceful labelingcordial labelingvertex labelingedge labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Diophantine equations (11D99)

Related Items (6)

On 3-total edge product cordial labeling of a carbon nanotube network ⋮ On \(3\)-total edge product cordial labeling of honeycomb ⋮ Full friendly index set. I ⋮ On friendly index sets of 2-regular graphs ⋮ 3-total edge product cordial labeling of rhombic grid ⋮ On total edge product cordial labeling of fullerenes

Cites Work

• The cordiality of one-point union of \(n\) copies of a graph
• A-cordial graphs
• NEPS operations on cordial graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cordial labeling of \(mK_ n\)