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.

Information Menu
Archive

Aspects Of Synchronizable Coding

L.J. Cummings1
1University of Waterloo
Read More »

The Generalized Moore Graphs On Eleven Vertices

R.W. Buskens1, R.G. Stanton1
1Department of Computer Science University of Manitoba Winnipeg, Canada R3T 2N2
Read More »

Vulnerability In Graphs-\(A\) Comparative Survey

C.A. Barefoot1, Roger Entringer2, Henda Swart3
1University of Colorado at Denver, Denver, CO 80202
2University of New Mexico, Albuquerque, NM 87131
3University of Natal, Durban 4001, Republic of South Africa
Abstract:

In assessing the “vulnerability” of a graph one determines the extent to which the graph retains certain properties after the removal of a number of vertices and/or edges. Four measures of vulnerability to vertex removal are compared for classes of graphs with edge densities ranging from that of trees to that of the complete graph.

Read More »

On Lander’s Conjecture for the Case \(\lambda=3\)

K.T. Arasu1
1Department of Mathematics and Statistics Wright State University Dayton, Ohio 45435
Abstract:

Lander conjectured: If D is a \((\text{v,k},\lambda)\) difference set in an abelian group \(G\) with a cyclic Sylow \(p\)-subgroup, then \(p\) does not divide \((v,n)\), where \(\text{n = k}-\lambda\).

Various nonexistence theorems are used to verify the above conjecture (all hand calculations) for \(\text{k} \leq 500\), except for \(\text{k} = 228, 282\) and \(444\), when \(\lambda = 3\). Using a machine, it is possible to do the checking for large \(k\).

Read More »
Submit Manuscript

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;
Propose a Special Issue

News & Announcements