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

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

Authors: Sze-Chin Shee, Yong-Song Ho 

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

Recommendations

• The cordiality of one-point union of \(n\) copies of a graph
• Graph operations and cordiality.
• On the cordiality of the \(t\)-ply \(P_t(u,v)\).
• The corona between cycles and paths
• Study of some problems of cordial graphs

zbMATH Keywords

labelling cordial graphspath-union

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

• On cordiality of one point unions and one edge unions of some classes of graphs
• One vertex union of shell graphs with a path at any common level is cordial
• Uniformly cordial graphs
• Graph operations and cordiality.
• Some new results on global dominating sets
• On the cordiality of \(D(1,3)\) graphs.
• On friendly index sets of 2-regular graphs
• \(Z_k\)-magic labeling of path union of graphs
• Title not available (Why is that?)
• Some cordial graphs in the context of barycentric subdivision
• The corona between cycles and paths
• Some results on specific graphs.
• NEPS operations on cordial graphs
• One point union of paths of cycles and their \(k\)-numbers
• The corona between paths and cycles.
• Title not available (Why is that?)
• 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
• Cordialness of cycles with parallel \(P_k\)-chords and multiple subdivision graphs
• SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS

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)