Some binary products and integer linear programming for k-metric dimension of graphs

作者：

Highlights：

• k-metric dimension is an invariant in graphs which is difficult to compute and frequently arise in applications.

• In this paper k-metric dimension of graphs is studied under some graph operations which are in turn suitable tools to approach NP-hard graph problems.

• Also, an integer linear programming model for computing the k-metric dimension as well as a k-metric basis of a given graph is proposed.

摘要

•k-metric dimension is an invariant in graphs which is difficult to compute and frequently arise in applications.•In this paper k-metric dimension of graphs is studied under some graph operations which are in turn suitable tools to approach NP-hard graph problems.•Also, an integer linear programming model for computing the k-metric dimension as well as a k-metric basis of a given graph is proposed.

论文关键词：Metric dimension,k-metric dimension,Binary product,Integer linear programming,Chemical graph theory

论文评审过程：Received 19 February 2021, Revised 24 May 2021, Accepted 29 May 2021, Available online 17 June 2021, Version of Record 17 June 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126420