E₃-cordiality of some helm-related graphs.

MaRDI QIDQ2804817zbMATH OpenFDO

Authors Mukund V. Bapat, Nirmala B. Limaye

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

wheeledge labeling\(E_k\)-cordial graphhelm

Mathematics Subject Classification ID

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

Recommendations

• On the \(E_3\)-cordiality of some graphs
• scientific article; zbMATH DE number 1792572
• On the cordiality of \(D(1,3)\) graphs.
• On the \(E_k\)-cordiality of some graphs.
• scientific article; zbMATH DE number 5259744
• scientific article; zbMATH DE number 6811310
• 3-difference cordiality of some special graphs
• HToH₃-Cordial Labeling of Some Families of Graphs
• 3-total quotient cordial labeling of some graphs
• scientific article; zbMATH DE number 7442454

Cited in

(6)

• On edge-3-equitability of \({\overline K}_n\)-union of helms
• scientific article; zbMATH DE number 1792572 (Why is no real title available?)
• On \(E_k\)-cordial labelling of \(M\)-graphs
• On the \(E_k\)-cordiality of some graphs.
• On the \(E_3\)-cordiality of some graphs
• Cordial and 3-equitable labeling for some wheel related graphs

This page was built for publication: \(E_3\)-cordiality of some helm-related graphs.

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