The cordiality of the path-union of \(n\) copies of a graph
From MaRDI portal
Publication:1916396
DOI10.1016/0012-365X(94)00099-5zbMath0852.05074OpenAlexW1970153914MaRDI QIDQ1916396
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
Related Items (8)
Vertex equitable labeling of union of cyclic snake related graphs ⋮ SIGNED CORDIAL LABELING AND SIGNED PRODUCT CORDIAL LABELING OF SOME INTERCONNECTION NETWORKS ⋮ \(L(3, 2, 1)\)-labeling of banana trees ⋮ Some new results on global dominating sets ⋮ Zk-Magic Labeling of Path Union of Graphs ⋮ Unnamed Item ⋮ Uniformly cordial graphs ⋮ On friendly index sets of 2-regular graphs
Cites Work
This page was built for publication: The cordiality of the path-union of \(n\) copies of a graph