On the cordiality of D(1,3) graphs.

MaRDI QIDQ2936734zbMATHFDO

Authors Chen-min Ni, Zhishan Liu

Publication date 6 January 2015

zbMATH Keywords

cordial graph\(D(1,3)\) graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5307941
• scientific article; zbMATH DE number 6811310
• Publication:4489888
• The cordiality of the path-union of \(n\) copies of a graph
• scientific article; zbMATH DE number 3997850

Cited in

(8)

• scientific article; zbMATH DE number 6811310 (Why is no real title available?)
• scientific article; zbMATH DE number 7442454 (Why is no real title available?)
• 3-difference cordiality of some corona graphs
• \(E_3\)-cordiality of some helm-related graphs.
• On the \(E_k\)-cordiality of some graphs.
• scientific article; zbMATH DE number 5926483 (Why is no real title available?)
• Generalization of some results on cordial graphs.
• scientific article; zbMATH DE number 5307941 (Why is no real title available?)

This page was built for publication: On the cordiality of \(D(1,3)\) graphs.

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