Title : ( Some binary products and integer linear programming fork-metric dimension of graphs )
Authors: Sandi Klavzar , Freydoon Rahbarnia , Mostafa Tavakoli ,Access to full-text not allowed by authors
Abstract
A sharp upper bound and a closed formula for the k-metric dimension of the hierarchical product of graphs is proved. Also, sharp lower bounds for the k-metric dimension of the splice and link products of graphs are presented. An integer linear programming model for computing the k-metric dimension as well as a k-metric basis of a given graph is proposed. These results are applied to bound or to compute the k-metric dimension of some classes of graphs that are of interest in mathematical chemistry.
Keywords
, Metric dimension k, metric dimension Binary product Integer linear programming Chemical graph theory@article{paperid:1087018,
author = {Sandi Klavzar and Rahbarnia, Freydoon and Tavakoli, Mostafa},
title = {Some binary products and integer linear programming fork-metric dimension of graphs},
journal = {Applied Mathematics and Computation},
year = {2021},
volume = {409},
number = {1},
month = {November},
issn = {0096-3003},
pages = {126420--126426},
numpages = {6},
keywords = {Metric dimension
k-metric dimension
Binary product
Integer linear programming
Chemical graph theory},
}
%0 Journal Article
%T Some binary products and integer linear programming fork-metric dimension of graphs
%A Sandi Klavzar
%A Rahbarnia, Freydoon
%A Tavakoli, Mostafa
%J Applied Mathematics and Computation
%@ 0096-3003
%D 2021