
In this paper we determine the metric dimension of K_a × K_b × K_c for all a,b,c∈ℕ with a ≤ b ≤ c as follows. For 3a c , it is ⌊2/3(b+c-1) ⌋ , and for 3a=b+c , it is ⌊a+b+c/2⌋ -1 . The only open case is 3a>b+c , where two values are possible, namely ⌊a+b+c/2⌋ -1 and ⌊a+b+c/2⌋ . This result extends previous results of [4], who computed the metric dimension of K_a × K_b , and of [14], who computed the metric dimension of K_a × K_a ×K_a . We prove our result by introducing and analyzing a new variant of Static Black-Peg Mastermind, in which each peg has its own permitted set of colors. For all cases, we present strategies which we prove to be both feasible and optimal. Our main result follows, as the number of questions of these strategies is equal to the metric dimension of K_a × K_b × K_c .
The k-Cycle Perfect Matching Reconfiguration Problem (k-Cycle-PM-RP) concerns the task of deciding if a pair of perfect matchings for a simple graph can be interconverted via a series of local rearrangements that allow for transitions between perfect matchings if and only if the symmetric difference of their edge sets induces a simple cycle of length k ∈ 2ℕ_>1 (Bonamy et al.; Proc. 44th MFCS; 2019). While it is known that the k-Cycle-PM-RP is PSPACE-complete in the case of bounded bandwidth and bounded degree bipartite graphs, as well as polynomial time solvable in the case of outerplanar graphs, cographs, and strongly orderable graphs, it has remained an open question whether the problem is fixed-parameter tractable in the genus of a graph. In this work, we answer this question by showing that the k-Cycle-PM-RP remains PSPACE-complete for bounded bandwidth and bounded degree planar graphs for every k ∈ 2ℕ_>1 . On the other hand, among some other positive results, we show that it is fixed-parameter tractable in a parameter r ∈ℕ to add at most r edges to a planar graph G to construct a strongly orderable planar graph G' , where we can observe that the ( k=4) -Cycle-PM-RP on strongly orderable graphs is both polynomial time tractable and guaranteed to admit a positive solution.
For a graph G, a set S⊆ V(G) is a cosecure dominating set if S is a dominating set of G and for each v ∈ S there exists a vertex v' ∈ N(v) ∖ S such that (S ∪{v'}) ∖{v} is also a dominating set. Given a graph G, Cosecure Domination (Co-SDS, in short) asks to find a minimum cosecure dominating set for G. The problem is W[2]-hard parameterized by the solution size. Kusum and Pandey (Theor. Comput. Sci., 2024) showed that Co-SDS is linear time solvable on graphs of bounded treewidth and cliquewdith by using monadic second order logic. In this paper, we present explicit algorithms for the problem with respect to structural parameters like modular width, treewidth, distance to cluster, distance to co-cluster, and vertex cover number. Here, we want to emphasize that the running times of all our FPT algorithms are single exponential or only slightly super-exponential. We further show that Co-SDS when parameterized by vertex cover number, does not admit a polynomial kernel unless 𝖼𝗈𝖭𝖯 ⊆ 𝖭𝖯/𝗉𝗈𝗅𝗒 .
We introduce the Red-Blue Unshared Domination (RBUD) problem, a variant of domination problems in graphs. Given an undirected graph G with vertices colored either red or blue, the goal is to find a minimum-size subset of vertices S such that for every red-blue pair of vertices outside S, there exist two distinct vertices in S (called unshared dominators), each dominating one vertex of the pair but not the other. Specifically, for each red vertex r ∉S and blue vertex b∉S , there must be a vertex in S that dominates r but not b and another vertex in S that dominates b but not r. We prove that the RBUD problem is NP-hard, even for bipartite planar subcubic graphs with large girth. We also provide an approximation algorithm for general graphs and exact efficient algorithms for trees and graphs with bounded neighborhood diversity. Additionally, we extend our algorithmic approach to graphs with bounded modular-width.
Rotation distance is a fundamental parameter in the study of tree balancing and data structures. One of the fundamental open problem in the area is to compute the minimum number of rotations required to transform one tree to the other, in which both trees have same number of nodes. We define shallow rotation distance with parameter k (which we call k-shallow rotation distance, denoted by d_k(T_1,T_2) ) to be the rotation distance between any two full binary trees when the rotation is allowed only at nodes within depth k. Indeed, 2-shallow rotation distance is well defined and is already the frontier of unknown territory in algorithmic approaches to rotation distance problem. In this paper, we identify a special case of rotation distance problem, known as the left- λ - RotDist and right- λ - RotDist and prove that they are as hard as the general version of the problem. Complementing this, we give a polynomial time algorithms for computing the d_2(T_1,T_2) in three scenarios (a) when T_1 is a right- λ -tree and T_2 is a right-comb tree, (b) when T_1 is a left- λ tree and T_2 is a left-comb-tree and (c) when T_1 is a left-right- λ -tree and T_2 is a double comb with matching subtree size, where a double-comb is a tree in which all the nodes are present only on the right-most or left-most path from the root. We obtain our results by using a known connection between the rotation distance and the well-studied algebraic object called Thompson’s group ℱ [8]. We use the forest representation for a pair of binary trees introduced by Belk and Brown (2005), where we design a new measure for pairs of spaces in the representation, and demonstrate that this new measure indeed captures the shortest representation of the group element in the above three scenarios.