{"cited_by_count":97666,"description":"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.","display_name":"Graph Labeling and Dimension Problems","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T12541","wikipedia":"https://en.wikipedia.org/wiki/Graph_labeling"},"field_id":"17","id":"T12541","keywords":[{"display_name":"graph labeling","id":"graph-labeling","score":0.8202,"url":"https://openalex.org/keywords/graph-labeling"},{"display_name":"edge coloring","id":"edge-coloring","score":0.3743,"url":"https://openalex.org/keywords/edge-coloring"},{"display_name":"maximum degree","id":"maximum-degree","score":0.2558,"url":"https://openalex.org/keywords/maximum-degree"},{"display_name":"edge labeling","id":"edge-labeling","score":0.7006,"url":"https://openalex.org/keywords/edge-labeling"},{"display_name":"path graphs","id":"path-graphs","score":0.3557,"url":"https://openalex.org/keywords/path-graphs"},{"display_name":"cycle graphs","id":"cycle-graphs","score":0.3219,"url":"https://openalex.org/keywords/cycle-graphs"},{"display_name":"total coloring","id":"total-coloring","score":0.877,"url":"https://openalex.org/keywords/total-coloring"},{"display_name":"metric dimension","id":"metric-dimension","score":0.4856,"url":"https://openalex.org/keywords/metric-dimension"},{"display_name":"star graphs","id":"star-graphs","score":0.207,"url":"https://openalex.org/keywords/star-graphs"},{"display_name":"graceful labeling","id":"graceful-labeling","score":0.9267,"url":"https://openalex.org/keywords/graceful-labeling"},{"display_name":"vertex coloring","id":"vertex-coloring","score":0.2413,"url":"https://openalex.org/keywords/vertex-coloring"},{"display_name":"wheel graphs","id":"wheel-graphs","score":0.3577,"url":"https://openalex.org/keywords/wheel-graphs"},{"display_name":"total chromatic number","id":"total-chromatic-number","score":0.8845,"url":"https://openalex.org/keywords/total-chromatic-number"},{"display_name":"resolving sets","id":"resolving-sets","score":0.7876,"url":"https://openalex.org/keywords/resolving-sets"},{"display_name":"vertex labeling","id":"vertex-labeling","score":0.5923,"url":"https://openalex.org/keywords/vertex-labeling"},{"display_name":"Cartesian product of graphs","id":"cartesian-product-of-graphs","score":0.2086,"url":"https://openalex.org/keywords/cartesian-product-of-graphs"},{"display_name":"magic graphs","id":"magic-graphs","score":0.9244,"url":"https://openalex.org/keywords/magic-graphs"},{"display_name":"total labeling","id":"total-labeling","score":0.9873,"url":"https://openalex.org/keywords/total-labeling"},{"display_name":"rainbow connection number","id":"rainbow-connection-number","score":0.9674,"url":"https://openalex.org/keywords/rainbow-connection-number"},{"display_name":"join of graphs","id":"join-of-graphs","score":0.235,"url":"https://openalex.org/keywords/join-of-graphs"},{"display_name":"cordial graphs","id":"cordial-graphs","score":0.9293,"url":"https://openalex.org/keywords/cordial-graphs"},{"display_name":"chromatic index","id":"chromatic-index","score":0.4551,"url":"https://openalex.org/keywords/chromatic-index"},{"display_name":"graceful graphs","id":"graceful-graphs","score":0.9009,"url":"https://openalex.org/keywords/graceful-graphs"},{"display_name":"L(2,1)-labeling","id":"l-2-1-labeling","score":0.9684,"url":"https://openalex.org/keywords/l-2-1-labeling"},{"display_name":"rainbow connection","id":"rainbow-connection","score":0.8573,"url":"https://openalex.org/keywords/rainbow-connection"}],"legacy_keywords":["Graph Labeling","Metric Dimension","Resolvability","Edge Coloring","Distinguishing Number","Irregularity Strength","Total Edge Irregularity","Neighbor Sum Distinguishing","Antimagic Labeling","Computational Complexity"],"openalex_id":"https://openalex.org/T12541","source_created_date":"2024-01-23T15:27:14","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1703","url":"/topics/T12541","works_api_url":"https://api.openalex.org/works?filter=topics.id:T12541","works_count":21097,"label":"Graph Labeling and Dimension Problems","provider":"openalex","revision":"ba53fd81740fe55f","taxonomy_revision":"f050b5d4780b1289","title":"Graph Labeling and Dimension Problems","kind":"topic-directory","aeo_cohort":"topic-directory","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","reviewed_answer":null}