Quaestiones Mathematicae, ( ISI ), Volume (46), No (12), Year (2023-12) , Pages (2517-2527)

#### Title : ( On mixed metric dimension in subdivision, middle, and total graphs )

Authors: , Sandi Klavzar , Mostafa Tavakoli , Ismael G. Yero ,

Citation: BibTeX | EndNote

#### Abstract

Let G be a graph and let S(G), M(G), and T (G) be the subdivision, the middle, and the total graph of G, respectively. Let dim(G), edim(G), and mdim(G) be the metric dimension, the edge metric dimension, and the mixed metric dimension of G, respectively. In this paper, for the subdivision graph it is proved that 1 2 max{dim(G), edim(G)} ≤ mdim(S(G)) ≤ mdim(G). A family of graphs Gn is constructed for which mdim(Gn) − mdim(S(Gn)) ≥ 2 holds and this shows that the inequality mdim(S(G)) ≤ mdim(G) can be strict, while for a cactus graph G, mdim(S(G)) = mdim(G). For the middle graph it is proved that dim(M(G)) ≤ mdim(G) holds, and if G is tree with n1(G) leaves, then dim(M(G)) = mdim(G) = n1(G). Moreover, for the total graph it is proved that mdim(T (G)) = 2n1(G) and dim(G) ≤ dim(T (G)) ≤ n1(G) hold when G is a tree.

#### Keywords

, Resolving set, mixed resolving set, edge resolving set, subdivision graph, middle graph, total graph, tree.
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@article{paperid:1093624,
author = {, and سندی کلاوژار and Tavakoli, Mostafa and اسماعیل یرو},
title = {On mixed metric dimension in subdivision, middle, and total graphs},
journal = {Quaestiones Mathematicae},
year = {2023},
volume = {46},
number = {12},
month = {December},
issn = {1607-3606},
pages = {2517--2527},
numpages = {10},
keywords = {Resolving set; mixed resolving set; edge resolving set; subdivision graph; middle graph; total graph; tree.},
}

%0 Journal Article
%T On mixed metric dimension in subdivision, middle, and total graphs
%A ,
%A سندی کلاوژار
%A Tavakoli, Mostafa
%A اسماعیل یرو
%J Quaestiones Mathematicae
%@ 1607-3606
%D 2023