This paper continues the results of “Domination Cover Pebbling: Graph Families.” An almost sharp bound for the domination cover pebbling (DCP) number, \( \psi(G) \), for graphs \( G \) with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between \( \lambda(G) \), the cover pebbling number of \( G \), and \( \psi(G) \) has been computed. A variant of domination cover pebbling, called subversion DCP, is introduced, and preliminary results are discussed.

A graph \(G\) has a representation modulo \(n\) if there exists an injective map \(f: V(G) \to \{0, 1, \dots, n-1\}\) such that vertices \(u\) and \(v\) are adjacent if and only if \(f(u) – f(v)\) is relatively prime to \(n\). The representation number \(rep(G)\) is the smallest \(n\) such that \(G\) has a representation modulo \(n\). In 2000, Evans, Isaak, and Narayan determined the representation number of a complete graph minus a path. In this paper, we refine their methods and apply them to the family of complete graphs minus a disjoint union of paths.

Let \(G = (V, E)\) be a graph and \(\overline{G}\) be the complement of \(G\). The complementary prism of \(G\), denoted \(G \overline{G}\), is the graph formed from the disjoint union of \(G\) and \(\overline{G}\) by adding the edges of a perfect matching between the corresponding vertices of \(G\) and \(\overline{G}\). A set \(D \subseteq V(G)\) is a locating-dominating set of \(G\) if for every \(u \in V(G) \setminus D\), its neighborhood \(N(u) \cap D\) is nonempty and distinct from \(N(v) \cap D\) for all \(v \in V(G) \setminus D\) where \(v \neq u\). The locating-domination number of \(G\) is the minimum cardinality of a locating-dominating set of \(G\). In this paper, we study locating-domination of complementary prisms. We determine the locating-domination number of \(G \overline{G}\) for specific graphs \(G\) and characterize the complementary prisms with small locating-domination numbers. We also present upper and lower bounds on the locating-domination numbers of complementary prisms, and we show that all values between these bounds are achievable.

A disjoint multiple paths problem asks if there exist paths between a given set of vertices. Constraints are applied so that paths are not allowed to share vertices (vertex disjoint multiple paths) or share edges (edge disjoint multiple paths). The vertex disjoint multiple paths problem is one of the classic NP-complete problems presented by Karp [1]. The edge disjoint multiple paths problem is also NP-complete since it is easily transformed from the vertex disjoint multiple paths problem. Because of its importance in electronic circuit design, studies are done for restricted cases. The edge disjoint multiple paths problem remains NP-complete for acyclic graphs and planar graphs. Furthermore, the edge disjoint multiple paths problem remains NP-complete if the graph is limited to an undirected mesh.

In this paper, the edge disjoint multiple paths problem when constructed over a directed mesh is discussed. We found that the multiple paths problem remains NP-complete in this special case. Three polynomial time algorithms are presented in which the following restrictions are made: (i) disjoint paths with the same origin row, the same destination row, distinct origin columns, and distinct destination columns, (ii) disjoint paths with the same origin column, the same destination column, distinct origin rows, and distinct destination rows, and (iii) disjoint paths with the same origin row, distinct origin columns, and distinct destination rows.

We discuss a transform on the set of rational functions over the finite field \( \mathbb{F}_q \). For a subclass of these functions, the transform yields a polynomial and its factorization as a product of the set of monic irreducible polynomials, all of which share a common property \( P \) that depends on the choice of rational function. A general formula is derived from the factorization for the number of monic irreducible polynomials of degree \( n \) having property \( P \). However, it is also possible in some instances to exploit the properties of the factorization to obtain a “closed” form of the answer more directly. We illustrate the method with four examples, two of which appear in the literature. In particular, we give alternative proofs for a result of L. Carlitz on the number of monic irreducible self-reciprocal polynomials and a remarkable result of S. D. Cohen on the number of \((r, m)\)-polynomials, that is, monic irreducible polynomials of the form \( f(x^r) \) of degree \( mr \). We also give a generalization of the factorization of \( x^{q-1} – 1 \) over \( \mathbb{F}_q \) that includes the factorization of \( x^{(q-1)^2} – 1 \). The new results concern translation invariant polynomials, which lead to a consideration of the orders of elements in \( \overline{\mathbb{F}}_q \), the algebraic closure of \( \mathbb{F}_q \). We show that there are an infinite number of \( \theta \in \overline{\mathbb{F}}_q \) such that \( \text{ord}(\theta) \) and \( \text{ord}(r(\theta)) \) are related, in the sense that given one, one can infer information about the other.

Let \( G \) be a graph with \( v \) vertices. If there exists a collection of lists of colors \(\{S_1, S_2, \ldots, S_v\}\) on its vertices, each of size \( k \), such that there exists a unique proper coloring for \( G \) from this list of colors, then \( G \) is called a \({uniquely \;k \;-list\; colorable \;graph}\). In this note, we present a uniquely \( 3 \)-list colorable, planar, and \( K_4 \)-free graph. It is a counterexample to a conjecture by Ch. Eslahchi, M. Ghebleh, and H. Hajiabolhassan [3].

For any integers \( k, d \geq 1 \), a \((p, q)\)-graph \( G \) with vertex set \( V(G) \) and edge set \( E(G) \), where \( p = |V(G)| \) and \( q = |E(G)| \), is said to be \((k, d)\)-strongly indexable (in short \((\textbf{k, d})\)-\textbf{SI}) if there exists a pair of functions \((f, f^+)\) that assigns integer labels to the vertices and edges, i.e., \( f: V(G) \to \{0, 1, \dots, p-1\} \) and \( f^+: E(G) \to \{k, k+d, k+2d, \dots, k+(q-1)d\} \), such that \( f^+(u, v) = f(u) + f(v) \) for any \((u, v) \in E(G)\). We determine here classes of spiders that are \((1, 2)\)-SI graphs. We show that every given \((1, 2)\)-SI spider can be extended to an \((1, 2)\)-SI spider with arbitrarily many legs.

In this paper, we obtain some new results, using inequalities such as Hölder and Minkowski, etc., on the existence of balanced arrays (B-arrays) with two levels and of strength six. We then discuss the use of these results to obtain the maximum number of constraints for B-arrays with given values of the parameter vector \(\underline{\mu}’\). We also include some illustrative examples.

A construction of a minimum cycle basis for the wreath product of a star by a path, two stars and a star by a wheel is given. Moreover, the basis numbers of these products are determined.

For any \( h \in \mathbb{N} \), a graph \( G = (V, E) \) is said to be \( h \)-magic if there exists a labeling \( l: E(G) \to \mathbb{Z}_h \setminus \{0\} \) such that the induced vertex labeling \( l^+: V(G) \to \mathbb{Z}_h \), defined by

\[ l^+(v) = \sum_{uv \in E(G)} l(uv), \]

is a constant map. When this constant is \( 0 \), we call \( G \) a zero-sum \( h \)-magic graph. The null set of \( G \) is the set of all natural numbers \( h \in \mathbb{N} \) for which \( G \) admits a zero-sum \( h \)-magic labeling. A graph \( G \) is said to be uniformly null if every magic labeling of \( G \) induces a zero sum. In this paper, we will identify the null sets of certain planar graphs such as wheels and fans.