Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path

DOI10.31801/cfsuasmas.586082zbMath1492.05137OpenAlexW2956061515MaRDI QIDQ5085774

Anita Pal, Sumonta Ghosh

Publication date: 27 June 2022

Published in: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.31801/cfsuasmas.586082

zbMATH Keywords

cordial labelinggraph labelingCartesian product of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On the graceful numbering of spanning trees
• Strongly multiplicative graphs
• On Additive Bases and Harmonious Graphs
• Some totally modular cordial graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item