The cordiality of one-point union of \(n\) copies of a graph

DOI10.1016/0012-365X(93)90337-SzbMath0781.05045MaRDI QIDQ686170

Sze-Chin Shee, Yong-Song Ho

Publication date: 9 November 1993

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

zbMATH Keywords

amalgamationcordialitycordial graphscordial labellingsvertex labelings

Mathematics Subject Classification ID

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

Related Items (12)

Cordial labeling of \(mK_ n\) ⋮ On friendly index sets of the edge-gluing of complete graph and cycles ⋮ EDGECUT POLYNOMIAL OF GRAPHS ⋮ The cordiality of the path-union of \(n\) copies of a graph ⋮ On 3-total edge product cordial labeling of a carbon nanotube network ⋮ On \(3\)-total edge product cordial labeling of honeycomb ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Uniformly cordial graphs ⋮ On friendly index sets of 2-regular graphs ⋮ 3-total edge product cordial labeling of rhombic grid ⋮ On total edge product cordial labeling of fullerenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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