The computational complexity of cordial and equitable labelling
From MaRDI portal
Publication:1567263
DOI10.1016/S0012-365X(99)00295-2zbMath0951.05091OpenAlexW1999087527MaRDI QIDQ1567263
Niall Cairnie, Keith J. Edwards
Publication date: 11 December 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00295-2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (9)
On friendly index sets of the edge-gluing of complete graph and cycles ⋮ On 3-total edge product cordial labeling of a carbon nanotube network ⋮ Full friendly index set. I ⋮ Cordial labeling of hypertrees ⋮ Klein cordial trees and odd cyclic cordial friendship graphs ⋮ On friendly index sets of 2-regular graphs ⋮ \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs ⋮ On friendly index sets of k-galaxies ⋮ On total edge product cordial labeling of fullerenes
This page was built for publication: The computational complexity of cordial and equitable labelling
