Graph Labeling and Dimension Problems
Graph Labeling and Dimension Problems is a topic indexed in ScholarIQ from OpenAlex.
What is known about 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.
How many works does Graph Labeling and Dimension Problems have?
Graph Labeling and Dimension Problems has 27,267 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
How many citations does Graph Labeling and Dimension Problems have?
Graph Labeling and Dimension Problems has 153,274 citations in the OpenAlex counts ScholarIQ stores.
What is the OpenAlex record for Graph Labeling and Dimension Problems?
The OpenAlex for Graph Labeling and Dimension Problems is on the source record.