Utilitas Algorithmica (UA)
ISSN: xxxx-xxxx (print)
Utilitas Algorithmica (UA) is a premier, open-access international journal dedicated to advancing algorithmic research and its applications. Launched to drive innovation in computer science, UA publishes high-impact theoretical and experimental papers addressing real-world computational challenges. The journal underscores the vital role of efficient algorithm design in navigating the growing complexity of modern applications. Spanning domains such as parallel computing, computational geometry, artificial intelligence, and data structures, UA is a leading venue for groundbreaking algorithmic studies.
- Research article
- https://doi.org/10.61091/jcmcc130-05
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 130
- Pages: 79-87
- Published Online: 13/02/2026
For a graph \(G\), let \(la(G)\) denote the linear arboricity of \(G\) and \(\Delta(G)\) denote the maximum degree of \(G\). The famous linear arboricity conjecture was made by Akiyama, Exoo, and Harary [Covering and packing in graphs. IV. Linear arboricity] in 1981. It asserts that \(la(G) \leq \Bigl\lceil\frac{\Delta(G)+1}{2}\Bigr\rceil\). In this paper, we prove the linear arboricity conjecture for products of a path and a complete graph, and for products of a path and a tree.
- Research article
- https://doi.org/10.61091/jcmcc130-04
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 130
- Pages: 63-78
- Published Online: 13/02/2026
Let \(G\) be a connected graph. The center function defined on \(G\) yields a set of vertices that minimizes the maximum distance from the given input vertices. Through axiomatic characterization of the center function, we identify the specific axioms that characterize its behavior on connected graphs. Universal axioms encompass the properties satisfied by the center function on all connected graphs. However, for some graphs, the center function cannot be fully characterized using universal axioms alone. To address this, a set of graph class-specific axioms, known as non-universal axioms, was introduced. In the case of book graphs (Cartesian product of star graph \(K_{1,n}\) and path \(P_2\)), the center function cannot be adequately characterized using known universal axioms. Therefore, in this context, we find an axiomatic characterization of the center function on book graphs using the universal axioms and one newly introduced Cycle Consensus \((CC)\) axiom.
- Research article
- https://doi.org/10.61091/um126-08
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 171-185
- Published Online: 13/02/2026
A supermagic labeling (often also called vertex-magic edge labeling) of a graph \(G(V,E)\) with \(|E|=q\) is a bijection from \(E\) to the set of first \(k\) positive integers such that the sum of labels of all incident edges of every vertex \(x\in V\) is equal to the same integer \(c\). An existence of a supermagic labeling of Cartesian product of two cycles, \(C_{n}\Box C_m\) for \(n,m\geq4\) and both \(n,m\) even and for any \(C_n\Box C_n\) with \(n\geq3\) was proved by Ivančo. Ivančo also conjectured that such labeling is possible for any \(C_n\Box C_m\) with \(n,m\geq3\). We prove his conjecture for all \(n,m\) odd that are not relatively prime.
- Research article
- https://doi.org/10.61091/um126-07
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 159-169
- Published Online: 12/02/2026
Let \(G=(V,E)\) be a graph. For a vertex \(u\) of \(V(G)\), its closed neighborhood, \(N[S]\), is defined as \(N[u]=\{u\}\cup\{v|v\in V(G), v\neq u, u\) and \(v\) are adjacent in \(G \}\). A vertex subset \(S\) of \(V(G)\) is called a subversion strategy of \(G\) if each of the vertices in \(N[S]\) is deleted from \(G\). By \(G/S\) we denote the survival subgraph \(G-N[S]\). A subversion strategy \(S\) is called a cut strategy of \(G\) if \(G/S\) is disconnected, or is a clique, or is empty. In this paper, we revise the definition of neighbor-isolated scattering number, which was introduced by Aslan, as \(NIS(G)=\max\{i(G/S)-|S|\}\), where \(S\) represents a cut strategy of \(G\) such that every component of \(G/S\) is an isolated vertex or a clique, and \(i(G/S)\) represents the number of the components of \(G/S\). We discuss the relationship between this parameter and the structure of graphs. Some tight bounds and extremal graphs with given order and neighbor-isolated scattering number are determined.
- Research article
- https://doi.org/10.61091/um126-06
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 125-157
- Published Online: 12/02/2026
Let \(k\) be an odd prime and choose \(s\in\mathbb{Z}_k^\times\) with \(s^2\not\equiv \pm1\pmod{k}\) (hence \(k\ge7\)). We give a deterministic, purely algebraic construction of compound pandiagonal (Nasik) magic squares of order \(k^{2}\) with consecutive entries \(\{0,1,\dots,k^{4}-1\}\). The input is the \(k\times k\) Modular Inverse Shift (MIS) kernel \(M_s(i,j)=si+s^{-1}j\in\mathbb{Z}_k\), a classical linear Latin square. Our contribution is not a new Latin-square object, but a closed-form integration of: (i) orthogonality of \((M_s,M_s^{\mathsf T})\), (ii) toroidal diagonal-regularity, and (iii) a two-level base-\(k\) digit superposition producing a \(k^2\times k^2\) square with closed-form evaluation of entries. We encode four \(\mathbb{Z}_k\)-digits coming from \((M_s,M_s^{\mathsf T})\) at both the block level and the within-block level, obtaining an explicit formula \(P_s(I,J)\in\{0,\dots,k^{4}-1\}\). Orthogonality yields bijectivity, while a carry-sensitive diagonal decomposition proves that every broken diagonal of both slopes sums to the magic constant. Finally, evaluating block sums shows that the induced \(k\times k\) block-sum array is itself pandiagonal magic, establishing the compound property.
- Research article
- https://doi.org/10.61091/um126-05
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 105-123
- Published Online: 12/02/2026
We provide a hierarchy of “nonconventional ergodic theorems” in quantum setting involving operators and unitaries acting on the Hilbert space of the Gelfand-Naimark-Segal covariant representation associated to a reference \(C^*\)-dynamical system. The first two levels correspond to the Mean Ergodic Theorem by J. von Neumann involving a unitary, and the ergodic theorem by Kovács and Szúcs relative to unitarily implemented automorphisms of von Neumann algebras, respectively. As a consequence, we provide multiple correlation results concerning the ergodic behaviour of “three-operator” expectations.
- Research article
- https://doi.org/10.61091/jcmcc130-03
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 130
- Pages: 33-61
- Published Online: 05/02/2026
We study a search problem on capturing a moving target on an infinite real line. Two autonomous mobile robots (which can move with a maximum speed of 1) are initially placed at the origin, while an oblivious moving target is initially placed at distance d from the origin. The robots can move along the line in either direction, but the target is oblivious, cannot change direction, and moves either away from or toward the origin at a constant speed v. Our aim is to design efficient algorithms for two robots to capture the target. The target is captured only when both robots are co-located with it. The robots communicate only face-to-face (F2F), meaning they can exchange information only when co-located. We design algorithms under various knowledge scenarios regarding d, v, and the target’s direction of movement. We analyze competitive ratios, i.e., the capture time versus the optimal full-knowledge scenario, and show that our strategies use at most three direction changes.
- Research article
- https://doi.org/10.61091/jcmcc130-02
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 130
- Pages: 19-32
- Published Online: 05/02/2026
We present a theorem which characterizes the class of line graphs of directed graphs. The characterization is an analogue of both the characterization of line graphs by Krausz (1943) and of directed line graphs of directed graphs by Harary and Norman (1960). Our characterization simplifies greatly in the case that the graph is bipartite. This and another result which we present draws attention to the special case of bipartite line graphs of directed graphs. As a result we explore the problem of finding the complete list of forbidden subgraphs for the class of bipartite line graphs of directed graphs. It appears, however, that this problem is extremely difficult. We do find two infinite families of forbidden subgraphs as well as several other illustrative examples.
- Research article
- https://doi.org/10.61091/um126-04
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 83-103
- Published Online: 05/02/2026
As a generalization of vector spaces over finite fields, we study vector spaces over finite commutative rings, and obtain Anzahl formulas and a dimensional formula for subspaces. By using these results, we discuss normalized matching (NM) property of a class of subspace posets.
- Research article
- https://doi.org/10.61091/um126-03
- Full Text
- Utilitas Mathematica
- Volume 126
- Pages: 55-81
- Published Online: 05/02/2026
IOur focus is on the set of lower-triangular, infinite matrices that have natural operations like addition, multiplication by a number, and matrix multiplication. With respect to addition this set forms and abelian group while with respect to matrix multiplication, the invertivle elements of the set form a group. The set becomes an algebra (non-commutative in fact) with unity when all three operations are considered together. We indicate important properties of the algebraic structures obtained in this way. In particular, we indicate several sub-groups or sub-rings. Among sub-groups, we consider the group of Riordan matrices and indicate its several sub-groups. We show a variety of examples (approximately 20) of matrices that are composed of the sequences of important polynomial or number families as entries of certain lower-triangular infinite matrices. New, significant relationships between these families can be discovered by applying well-known matrix operations like multiplication and inverse calculation to this representation. The paper intends to compile numerous simple facts about the lower-triangular matrices, specifically the family of Rionian matrices, and briefly review their properties.




