On the E₃-cordiality of some graphs

MaRDI QIDQ2829331zbMATH OpenFDO

Authors Chen-min Ni, Zhishan Liu, 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

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5056648
• scientific article; zbMATH DE number 1792572
• scientific article; zbMATH DE number 1409217
• \(E_3\)-cordiality of some helm-related graphs.
• On \(E_k\)-cordial labelling of \(M\)-graphs

Cited in

(15)

• On \(E_4\)-cordial graphs.
• \(E_3\)-cordiality of some helm-related graphs.
• On the \(E_k\)-cordiality of some graphs.
• The H_k-cordiality of trees
• scientific article; zbMATH DE number 5926483 (Why is no real title available?)
• Some new results on E-cordial labeling
• 3-difference cordiality of some corona graphs
• scientific article; zbMATH DE number 1792572 (Why is no real title available?)
• scientific article; zbMATH DE number 6811310 (Why is no real title available?)
• On \(E_k\)-cordial labeling.
• scientific article; zbMATH DE number 1409217 (Why is no real title available?)
• On \(E_k\)-cordial labelling of \(M\)-graphs
• scientific article; zbMATH DE number 7442454 (Why is no real title available?)
• scientific article; zbMATH DE number 5056648 (Why is no real title available?)
• (2, 3)-cordial trees and paths

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)