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

zbMATH Open1363.05202MaRDI QIDQ2828862FDOQ2828862

Authors: Zhishan Liu, Qing Liu 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

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

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)

Cited In (1)

• Title not available (Why is that?)

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)