相关论文: Perfect 2-colorings of the generalized Petersen gr…
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…
In this paper the strong metric dimension of generalized Petersen graphs $GP(n,2)$ is considered. The exact value is determined for cases $n=4k$ and $n=4k+2$, while for $n=4k+1$ an upper bound of the strong metric dimension is presented.
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
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…
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…
The star chromatic index of a graph $G$, denoted by $\chi^\prime_s(G)$, is the smallest integer $k$ for which $G$ admits a proper edge coloring with $k$ colors such that every path and cycle of length four is not bicolored. Let $d$ be the…
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…
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…
We prove that the number of $1$-factorisations of a generalised Petersen graph of the type $GP(3k,k)$ is equal to the $k$th Jacobsthal number $J(k)$ if $k$ is odd, and equal to $4J(k)$, when $k$ is even. Moreover, we verify the list…
We consider the problem of existence of perfect $2$-colorings (equitable $2$-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we…
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…
The forcing number of a perfect matching $M$ of a graph $G$ is the smallest cardinality of subsets of $M$ that are contained in no other perfect matchings of $G$. The forcing spectrum of $G$ is the collection of forcing numbers of all…
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…
A total weighting of a graph $G$ is a mapping $\phi$ that assigns a weight to each vertex and each edge of $G$. The vertex-sum of $v \in V(G)$ with respect to $\phi$ is $S_{\phi}(v)=\sum_{e\in E(v)}\phi(e)+\phi(v)$. A total weighting is…
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$,…
We study perfect $2$-coloring of the Johnson graphs $J(n,3)$ associated with the third largest eigenvalue and symmetric quotient matrix, which exists only when $n \in \{6, 10\}$. We survey the known constructions in the case $n=6$, give a…
The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…
In this paper, we investigate the domination number of generalized Petersen graphs P(n, 2) when there is a faulty vertex. Denote by $\gamma(P(n,2))$ the domination number of P(n,2) and $\gamma(P_f(n,2))$ the domination number of P(n,2) with…
The crossing number of a graph is the least number of crossings of edges among all drawings of the graph in the plane. In this article, we prove that the crossing number of the generalized Petersen graph P(10, 3) is equal to 6.
Complete colorings have the property that any two color classes has at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers comes from complete colorings, with some additional requirement. In…