Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph

DOI10.1155/2020/6267072MaRDI QIDQ2210246zbMATH OpenOpenAlexFDO

Publication date 5 November 2020

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Abstract: Let

G

be a finite, connected graph of order of at least 2, with vertex set

V (G)

and edge set

E (G)

. A set

S

of vertices of the graph

G

is a doubly resolving set for

G

if every two distinct vertices of

G

are doubly resolved by some two vertices of

S

. The minimal doubly resolving set of vertices of graph

G

is a doubly resolving set with minimum cardinality and is denoted by

p s i (G)

. In this paper, first, we construct a class of graphs of order

2 n + S i g m a_{r = 1}^{k - 2} n m^{r}

, denoted by

L S G (n, m, k)

, and call these graphs as the layer Sun graphs with parameters

n

,

m

and

k

. Moreover, we compute minimal doubly resolving sets and the strong metric dimension of layer Sun graph

L S G (n, m, k)

and the line graph of the layer Sun graph

L S G (n, m, k)

.

Review text

Summary: Let \(G\) be a finite, connected graph of order of, at least, 2 with vertex set \(V(G)\) and edge set \(E(G)\). A set \(S\) of vertices of the graph \(G\) is a doubly resolving set for \(G\) if every two distinct vertices of \(G\) are doubly resolved by some two vertices of \(S\). The minimal doubly resolving set of vertices of graph \(G\) is a doubly resolving set with minimum cardinality and is denoted by \(\psi(G)\). In this paper, first, we construct a class of graphs of order \(2n+ \Sigma_{r=1}^{k-2}\text{nm}^r\), denoted by \(\text{LSG}(n,m,k)\), and call these graphs as the layer Sun graphs with parameters \(n\), \(m\), and \(k\). Moreover, we compute minimal doubly resolving sets and the strong metric dimension of the layer Sun graph \(\text{LSG}(n,m,k)\) and the line graph of the layer Sun graph \(\text{LSG}(n,m,k)\).

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210246)