The cordiality of the path-union of n copies of a graph

DOI10.1016/0012-365X(94)00099-5zbMATH Open0852.05074OpenAlexW1970153914MaRDI QIDQ1916396FDOQ1916396

Yong-Song Ho, Sze-Chin Shee

Publication date: 25 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00099-5

zbMATH Keywords

labelling cordial graphspath-union

Mathematics Subject Classification ID

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

Cites Work

• The cordiality of one-point union of \(n\) copies of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Zk-Magic Labeling of Path Union of Graphs
• Uniformly cordial graphs
• Some new results on global dominating sets
• Title not available (Why is that?)
• On friendly index sets of 2-regular graphs
• NEPS operations on cordial graphs
• The cordiality of one-point union of \(n\) copies of a graph
• Title not available (Why is that?)
• \(L(3, 2, 1)\)-labeling of banana trees
• Vertex equitable labeling of union of cyclic snake related graphs
• SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS

   Recommendations

• The cordiality of one-point union of \(n\) copies of a graph 👍 👎
• Title not available (Why is that?) 👍 👎
• On the cordiality of the \(t\)-ply \(P_t(u,v)\). 👍 👎
• The corona between cycles and paths 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The cordiality of the path-union of \(n\) copies of a graph

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