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

zbMATH Open1313.05324MaRDI QIDQ2936734FDOQ2936734

Authors: Chen-min Ni, Zhishan Liu 

Publication date: 6 January 2015

Recommendations

• scientific article
• 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (8)

• 3-difference cordiality of some corona graphs
• Title not available (Why is that?)
• \(E_3\)-cordiality of some helm-related graphs.
• On the \(E_k\)-cordiality of some graphs.
• Generalization of some results on cordial graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)