https://openalex.org/T12541
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.
@prefix oasubfields: <https://openalex.org/subfields/> .
@prefix openalex: <https://lambdamusic.github.io/openalex-hacks/ontology/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
<https://openalex.org/T12541> a skos:Concept ;
rdfs:label "Graph Labeling and Dimension Problems"@en ;
rdfs:isDefinedBy openalex: ;
owl:sameAs <https://en.wikipedia.org/wiki/Graph_labeling>,
<https://openalex.org/T12541> ;
skos:broader oasubfields:1703 ;
skos:definition "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."@en ;
skos:inScheme openalex: ;
skos:prefLabel "Graph Labeling and Dimension Problems"@en ;
openalex:cited_by_count 147347 ;
openalex:works_count 21435 .