The computational complexity of cordial and equitable labelling

DOI10.1016/S0012-365X(99)00295-2MaRDI QIDQ1567263zbMATH OpenOpenAlexFDO

Authors Niall Cairnie, Keith 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

zbMATH Keywords

NP-completenesscordial graphsgraph labellingequitable labelling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Algorithmic complexity of proper labeling problems
• Computing equilibria: a computational complexity perspective
• Complexity of (p,1)-total labelling
• scientific article; zbMATH DE number 7364985
• Graceful labeling algorithms and complexity -- a survey
• Graph labelings derived from models in distributed computing: A complete complexity classification
• Optimal labelling schemes for adjacency, comparability, and reachability
• scientific article; zbMATH DE number 1004939
• Algorithms and complexity for a class of combinatorial optimization problems with labelling
• scientific article; zbMATH DE number 4174982

Cited in

(10)

• Cordial labeling of hypertrees
• On friendly index sets of 2-regular graphs
• On total edge product cordial labeling of fullerenes
• \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
• On friendly index sets of the edge-gluing of complete graph and cycles
• Full friendly index set. I
• On 3-total edge product cordial labeling of a carbon nanotube network
• Klein cordial trees and odd cyclic cordial friendship graphs
• On friendly index sets of \(k\)-galaxies
• Cordial forests

This page was built for publication: The computational complexity of cordial and equitable labelling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567263)