On the E_k-cordiality of some graphs.

MaRDI QIDQ2804837zbMATH OpenFDO

Authors Zhishan Liu, Haiping Wu, Qing Liu

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

1-factor\(E_k\)-cordial graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the \(E_3\)-cordiality of some graphs
• scientific article; zbMATH DE number 4210188
• On \(E_k\)-cordial labelling of \(M\)-graphs
• On \(E_4\)-cordial graphs.
• On the cordiality of \(D(1,3)\) graphs.
• Generalization of some results on cordial graphs.
• Some new families of E-cordial graphs
• On \(E_k\)-cordial labeling.
• \(E_3\)-cordiality of some helm-related graphs.
• scientific article; zbMATH DE number 4210187

Cited in

(4)

• \(E_3\)-cordiality of some helm-related graphs.
• On \(E_4\)-cordial graphs.
• A necessary and sufficient condition for a graph to be \(E_2\)-cordial.
• Generalization of some results on cordial graphs.

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

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