A necessary and sufficient condition for a graph to be E₂-cordial.

MaRDI QIDQ2828862zbMATH OpenFDO

Authors Zhishan Liu, Qing Liu

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

maximal matching\(E_2\)-cordial graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the \(E_k\)-cordiality of some graphs.
• scientific article; zbMATH DE number 5307941
• On \(E_4\)-cordial graphs.
• Publication:4940057
• On the cordiality of the \(t\)-ply \(P_t(u,v)\).

Cited in

(2)

• scientific article; zbMATH DE number 5630886 (Why is no real title available?)
• On \(E_4\)-cordial graphs.

This page was built for publication: A necessary and sufficient condition for a graph to be \(E_2\)-cordial.

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