相关论文: The strong metric dimension of some generalized Pe…

The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations and the edge metric dimension of generalized Petersen graphs…

The metric dimension of a graph $G$ is defined as the minimum number of vertices in a subset $S\subset V(G)$ such that all other vertices are uniquely determined by their distances to the vertices in $S$, and is denoted by $\dim(G)$. In…

A generalized Petersen graph $GP(n,k)$ is a regular cubic graph on $2n$ vertices (the parameter $k$ is used to define some of the edges). It was previously shown (Ball et al., 2015) that the cop number of $GP(n,k)$ is at most $4$, for all…

It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph $P(n,k)$ is at least 3. We prove that the graph $P(n,3)$ has edge dimension 4 for $n\ge 11$,…

In this paper, the strong and doubly metric dimensions of Johnson and Kneser graphs are considered. The exact value of the strong metric dimension of Johnson graph $J_{n,k}$ is obtained using the well-known results from the literature. The…

We show that if $n=7k/i$ with $i \in \{1,2,3\}$ then the cop number of the generalised Petersen graph $GP(n,k)$ is $4$, with some small previously-known exceptions. It was previously proved by Ball et al. (2015) that the cop number of any…

Due to their broad application to different fields of theory and practice, generalized Petersen graphs $GPG(n,s)$ have been extensively investigated. Despite the regularity of generalized Petersen graphs, determining an exact formula for…

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…

The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the…

In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n;3), where n>=7. We also give some basic results for GP(n; k).

For an ordered subset $S = \{s_1, s_2,\dots s_k\}$ of vertices and a vertex $u$ in a connected graph $G$, the metric representation of $u$ with respect to $S$ is the ordered $k$-tuple $ r(u|S)=(d_G(v,s_1), d_G(v,s_2),\dots,$ $d_G(v,s_k))$,…

A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd…

We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…

Let $G$ be a simple and connected graph with vertex set $V(G)$. A vertex $w\in V(G)$ strongly resolves two vertices $u,v \in V(G)$ if $v$ belongs to a shortest $u-w$ path or $u$ belongs to a shortest $v-w$ path. A set $W \subseteq V(G)$ is…

For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph $P(n,k)$, is defined by vertex set $\lbrace u_i,v_i\rbrace$ and edge set $\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\rbrace$; where $i = 1,2,\dots,n$ and subscripts are…

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,v\in V(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for…

Determining the size of a maximum independent set of a graph $G$, denoted by $\alpha(G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $\alpha (G)$ for special classes of…

Let $G$ be a connected graph. A vertex $w$ {\em strongly resolves} a pair $u, v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a {\em strong…

In this paper we find the number of different signatures of $P(3,1), P(5,1)$ and $P(7,1)$ upto switching isomorphism, where $P(n, k)$ denotes the generalised Petersen graph, $2k < n$. We also count the number of non-isomorphic signatures on…