The cordiality of one-point union of \(n\) copies of a graph
From MaRDI portal
Publication:686170
DOI10.1016/0012-365X(93)90337-SzbMath0781.05045MaRDI QIDQ686170
Publication date: 9 November 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
On total edge product cordial labeling of fullerenes, EDGECUT POLYNOMIAL OF GRAPHS, Unnamed Item, Unnamed Item, On friendly index sets of the edge-gluing of complete graph and cycles, On friendly index sets of 2-regular graphs, Cordial labeling of \(mK_ n\), The cordiality of the path-union of \(n\) copies of a graph, On 3-total edge product cordial labeling of a carbon nanotube network, 3-total edge product cordial labeling of rhombic grid, On \(3\)-total edge product cordial labeling of honeycomb, Uniformly cordial graphs
Cites Work