4-cordiality of some regular graphs and the complete 4-partite graph

zbMATH Open1233.05183MaRDI QIDQ3089293FDOQ3089293

Authors: Naseam A. Al-Kuleab, Maged Z. Youssef 

Publication date: 24 August 2011

Recommendations

• Generalized graph cordiality
• Some new results on \(k\)-cordial labeling.
• scientific article; zbMATH DE number 5529050
• A-cordial graphs
• Cordial labeling of \(mK_ n\)

zbMATH Keywords

regular graphladdercomplete 4-partite graph\(k\)-cordial labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (13)

• Generalized graph cordiality
• Three-regular parts of four-regular graphs
• Title not available (Why is that?)
• A dual of 4-regular graph forG × C_2n
• \(s\)-regular dihedral coverings of the complete graph of order 4
• \(C_4\)-saturated bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular 4‐critical graphs of even degree
• Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\)
• Some new results on \(k\)-cordial labeling.
• The numbers of cut-vertices and end-blocks in 4-regular graphs

This page was built for publication: 4-cordiality of some regular graphs and the complete 4-partite graph

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