Graph Labeling and Dimension Problems

Graph Labeling and Dimension Problems is a research topic within Computational Theory and Mathematics. Science Explorer counts 15k research works in it since 1951. 10.1% of them reached the world's top 10% most cited for their field and year.

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.

• Graph Labeling
• Metric Dimension
• Resolvability
• Edge Coloring
• Distinguishing Number
• Irregularity Strength
• Total Edge Irregularity
• Neighbor Sum Distinguishing
• Antimagic Labeling
• Computational Complexity