{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","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.","keywords":[{"id":"https://openalex.org/keywords/graph-labeling","display_name":"graph labeling","score":0.8202},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"edge coloring","score":0.3745},{"id":"https://openalex.org/keywords/maximum-degree","display_name":"maximum degree","score":0.2555},{"id":"https://openalex.org/keywords/edge-labeling","display_name":"edge labeling","score":0.7009},{"id":"https://openalex.org/keywords/path-graphs","display_name":"path graphs","score":0.3555},{"id":"https://openalex.org/keywords/cycle-graphs","display_name":"cycle graphs","score":0.3221},{"id":"https://openalex.org/keywords/total-coloring","display_name":"total coloring","score":0.877},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"metric dimension","score":0.4854},{"id":"https://openalex.org/keywords/star-graphs","display_name":"star graphs","score":0.207},{"id":"https://openalex.org/keywords/graceful-labeling","display_name":"graceful labeling","score":0.9267},{"id":"https://openalex.org/keywords/vertex-coloring","display_name":"vertex coloring","score":0.2411},{"id":"https://openalex.org/keywords/wheel-graphs","display_name":"wheel graphs","score":0.3574},{"id":"https://openalex.org/keywords/total-chromatic-number","display_name":"total chromatic number","score":0.8845},{"id":"https://openalex.org/keywords/resolving-sets","display_name":"resolving sets","score":0.7876},{"id":"https://openalex.org/keywords/vertex-labeling","display_name":"vertex labeling","score":0.5923},{"id":"https://openalex.org/keywords/cartesian-product-of-graphs","display_name":"Cartesian product of graphs","score":0.2082},{"id":"https://openalex.org/keywords/magic-graphs","display_name":"magic graphs","score":0.9244},{"id":"https://openalex.org/keywords/total-labeling","display_name":"total labeling","score":0.9873},{"id":"https://openalex.org/keywords/rainbow-connection-number","display_name":"rainbow connection number","score":0.9674},{"id":"https://openalex.org/keywords/join-of-graphs","display_name":"join of graphs","score":0.2344},{"id":"https://openalex.org/keywords/cordial-graphs","display_name":"cordial graphs","score":0.9295},{"id":"https://openalex.org/keywords/chromatic-index","display_name":"chromatic index","score":0.4566},{"id":"https://openalex.org/keywords/graceful-graphs","display_name":"graceful graphs","score":0.9009},{"id":"https://openalex.org/keywords/l-2-1-labeling","display_name":"L(2,1)-labeling","score":0.9685},{"id":"https://openalex.org/keywords/rainbow-connection","display_name":"rainbow connection","score":0.8573}],"legacy_keywords":"Graph Labeling; Metric Dimension; Resolvability; Edge Coloring; Distinguishing Number; Irregularity Strength; Total Edge Irregularity; Neighbor Sum Distinguishing; Antimagic Labeling; Computational Complexity","ids":{"openalex":"https://openalex.org/T12541","wikipedia":"https://en.wikipedia.org/wiki/Graph_labeling"},"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"},"siblings":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification"},{"id":"https://openalex.org/T10211","display_name":"Computational Drug Discovery Methods"},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research"},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis"},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs"},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms"},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms"},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic"},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling"},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation"},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory"},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms"},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic"},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms"},{"id":"https://openalex.org/T12100","display_name":"Advanced Mathematical Modeling in Engineering"},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications"},{"id":"https://openalex.org/T12469","display_name":"Chaos, Complexity, and Education"},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis"},{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control"},{"id":"https://openalex.org/T12809","display_name":"Contact Mechanics and Variational Inequalities"},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata"},{"id":"https://openalex.org/T13286","display_name":"Modeling and Simulation Systems"},{"id":"https://openalex.org/T13523","display_name":"Mathematics, Computing, and Information Processing"}],"works_count":21122,"cited_by_count":97723,"works_api_url":"https://api.openalex.org/works?filter=topics.id:T12541","updated_date":"2026-10-21T03:01:35","created_date":"2024-01-23T15:27:14"}