Intersection cordiality of union of some standard graphs

DOI10.1080/09720529.2019.1696240MaRDI QIDQ5036689zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 23 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2019.1696240

zbMATH Keywords

cordial labelingintersection cordial graphsintersection cordial labeling

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Further results on (_1,_2,,_K) cordial labeling of graphs
• Cordial labeling of \(mK_ n\)
• On cordial and balanced labelings of graphs
• scientific article; zbMATH DE number 7009334
• Study of some problems of cordial graphs

Cited in

(3)

• One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
• scientific article; zbMATH DE number 5844223 (Why is no real title available?)
• Uniform intersection set-labelings of a graph. I: Regularisable graphs

This page was built for publication: Intersection cordiality of union of some standard graphs

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