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.

Terry A.McKee1
1Department of Mathematics and Statistics Wright State University Dayton, Ohio USA 45435
Abstract:

Much of chordal graph theory and its applications is based on chordal graphs being the intersection graphs of subtrees of trees. This suggests also looking at intersection graphs of subgraphs of chordal graphs, and so on, with appropriate conditions imposed on the subgraphs.This paper investigates such a hierarchy of generalizations of “chordal-type” graphs, emphasizing the so-called “ekachordal graphs” — those next in line beyond chordal graphs. Parts of the theory of chordal graphs do carry over to chordal-type graphs, including a recursive, elimination characterization for ekachordal graphs.

C.J. Colbourn1, D.R. Stinson2, L. Zhu3
1 Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada N2L 3Gi
2 Department of Computer Science and Engineering University of Nebraska Lincoln, NE 68588-0115, U.S.A.
3 Department of Mathematics Suzhou University Suzhou, 215006, China
Abstract:

We present a new construction to obtain frames with block size four using certain skew Room frames. The existence results of Rees and Stinson for frames with block size four are improved, especially nfor hole sizes divisible by \(6\). As a by-product of the skew Room frames we construct, we are also able to show that a resolvable \((K_4 – e)\)-design with \(60t + 16\) points exists if \(t \geq 0\) and \(t \neq 8, 12\).

Frank Rhodes1
1 Department of Mathematics University of Southampton. Southampton SO17 1BJ
Abstract:

It has been proved that the smallest rectangular board on which a \( (p, q) \)-knight’s graph is connected has sides \( p+q \) by \( 2q \) when \( p < q \). It has also been proved that these minimal connected knight's graphs are of genus \( 0 \) or \( 1 \), and that they are of genus \( 0 \) when \( p \) and \( q \) are of the form \( Md+1 \) and \( (M+1)d+1 \), with \( M \) a non-negative integer and \( d \) a positive odd integer. It is proved in this paper that the minimal connected knight's graph is of genus \( 1 \) in all other cases.

F. Hurtado1, M. Noy1
1 Departament de Matematica Aplicada II Universitat Politécnica de Catalunya Pau Gargallo 5, 08028 Barcelona, Spain
Abstract:

We define an almost-convex polygon as a non-convex polygon in which any two vertices see each other inside the polygon unless they are not adjacent and belong to a chain of consecutive concave vertices. Using inclusion-exclusion techniques, we find formulas for the number of triangulations of almost-convex polygons in terms of the number and position of the concave vertices. We translate these formulas into the language of generating functions and provide several simple asymptotic estimates. We also prove that certain balanced configurations yield the maximum number of triangulations.

Machua Le1
1Department of Mathematics Zhanjiang Teachers College P.O. Box 524048 Zhanjiang, Guangdong P R of China
Abstract:

Let \(n,s\) be positive integers, and let \(r = 1 + \frac{1}{s}\). In this note we prove that if the sequence \(\{a_n(r)\}_{n=1}^{\infty}\) satisfies \(ra_n(r)= \sum_{k=1}^{n}\binom{n}{k}a_k(r), n> 1\), then \(a_n(r) = na_1(r)\left[(n -1)! / {(s+1)}(log r)^n+{{1/r(s+1)}} \right]\). Moreover, we obtain a related combinatorial identity.

Yanxun Chang1, Guihua Yang2, Qingde Kang1
1Institute of Math., Hebei Normal College Shijiazhuang 050091, P, R. China
2 Basic Teaching Bureau Hebei Institute of Finance and Economics Shijiazhuang 050091, P, R. China
Abstract:

A Mendelsohn triple system, \(MTS(v) = (X, \mathcal{B})\), is called self-converse if it and its converse \((X, \mathcal{B}^{-1})\) are isomorphic, where \(\mathcal{B}^{-1 } = \{\langle z,y,x\rangle; \langle x,y,z\rangle \in \mathcal{B}\}\). In this paper, the existence spectrum of self-converse \(MTS(v)\) is given, which is \(v \equiv 0\) or \(1 \pmod{3}\) and \(v \neq 6\).

Qiongxiang Huang1, Jinjiang Yuan2
1Department of Mathematics, Xinjiang University, Urumudi, Xinjiang, 830046, P.R.China.
2 Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, 450052, P.R.China.
Abstract:

In this paper, we discuss the automorphism groups of circulant digraphs. Our main purpose is to determine the full automorphism groups of circulant digraphs of degree \(3\).

Peter Adams1, Elizabeth J.Billington2
1 Centre for Combinatorics, Department of Mathematics, The University of Queensland, Queensland 4072, Australia.
2 Centre for Combinatorics, Department of Mathematics, The University of Queensland, Queensland 4072, Australia.
Abstract:

The spectrum for the decomposition of \(\lambda K_v\) into \(3\)-perfect \(9\)-cycles is found for all \(\lambda > 1\). (The case \(\lambda = 1\) was dealt with in an earlier paper by the authors and Lindner.) The necessary conditions for the existence of a suitable decomposition turn out to be sufficient.

Zhike Jiang1, Mary McLeish1
1 Department of Computing and Information Science University of Guelph Guelph, Ontario Canada NIG 2W1
Abstract:

A directed triple system of order \(v\), denoted by \(DTS(v)\), is called \((f,k)\)-rotational if it has an automorphism consisting of \(f\) fixed points and \(k\) cycles each of length \((v-f)/k\). In this paper, we obtain a necessary and sufficient condition for the existence of \((f,k)\)-rotational \(DTS(v)\) for any arbitrary positive integer \(k\).

V. Linek1, B. Sands2
1Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario N2L 3G1 Canada
2Department of Mathematics and Statistics University of Calgary Calgary, Alberta T2N 1N4 Canada

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;