Graph Labeling and Dimension Problems

This cluster of papers focuses on various graph labeling and dimension problems, including metric dimension, resolvability, edge coloring, distinguishing number, irregularity strength, total edge irregularity, neighbor sum distinguishing, antimagic labeling, and computational complexity. The papers explore different aspects of assigning labels to the vertices and edges of graphs with applications in network discovery, security, and cryptographic constructions.