On the E₃-cordiality of some graphs

zbMATH Open1353.05110MaRDI QIDQ2829331FDOQ2829331

Zhishan Liu, Chen-min Ni, Fuliang Lu

Publication date: 27 October 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

trees\(E_3\)-codial graph\(K_{m,n}\)\(P_m\times P_n\)edge-cordial labellings

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• 3-difference cordiality of some corona graphs
• Title not available (Why is that?)
• \(E_3\)-cordiality of some helm-related graphs.
• On the \(E_k\)-cordiality of some graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the \(E_3\)-cordiality of some graphs

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