# Graph Labeling and Dimension Problems

{
  "id": "T12541",
  "title": "Graph Labeling and Dimension Problems",
  "url": "/topics/T12541",
  "kind": "topic-directory",
  "aeo_cohort": "topic-directory",
  "provider": "openalex",
  "revision": "ba53fd81740fe55f",
  "catalogue_revision": "f050b5d4780b1289",
  "numeric_address": "38285273125784671",
  "address_version": "morton4x16-v1",
  "coordinates": [
    3,
    17,
    1703,
    12541
  ],
  "answer_status": "Directory metadata; local answer requires separate source review",
  "truth_status": "Subject descriptor, not a factual answer or a demonstrated knowledge gap"
}

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.

Directory metadata is not a factual answer or evidence of a global knowledge gap.

Source: https://openalex.org/T12541

No owner-reviewed local answer yet.