Incidence dimension and 2-packing number in graphs

DOI10.1051/ro/2022001zbMath1483.05113arXiv1811.03156OpenAlexW4206733372MaRDI QIDQ5034794

Aleksander Kelenc, Dragana Božović, Ismael González Yero, Iztok Peterin

Publication date: 21 February 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03156

zbMATH Keywords

2-packingincidence dimensionincidence generator

Mathematics Subject Classification ID

Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The difference between several metric dimension graph invariants

This page was built for publication: Incidence dimension and 2-packing number in graphs