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.

Saadet Arslan 1, Fikri Koken2
1SeLcuk University, Facutry or EDUCATION, DEPARTMENT OF MATHEMATICS, 42090 MERAM, KONYA, TURKEY
2Setcuk UNtversiry, FACULTY oF Science, DEPARTMENT OF MATHEMATICS, 42075 KaMmPus, Konya, TURKEY
Abstract:

In this paper, we present the complex factorizations of the Jacobsthal and Jacobsthal Lucas numbers by determinants of tridiagonal matrices.

E. Kilic1, D. Tasci2
1TOBB ECONOMICS AND TECHNOLOGY UNIVERSITY MATHEMATICS DEPARTMENT 06560 ANKARA TURKEY
2Gazi University, DEPARTMENT OF MATHEMATICS, 06500 ANKARA TURKEY
Abstract:

In this paper, we find families of \((0, -1, 1)\)-tridiagonal matrices whose determinants and permanents equal the negatively subscripted Fibonacci and Lucas numbers. Also, we give complex factorizations of these numbers by the first and second kinds of Chebyshev polynomials.

Bart De Bruyn1
1 Ghent University, Department of Pure Mathematics and Computer Algebra, Galglaan 2, B-9000 Gent, Belgium,
Abstract:

We classify all finite near hexagons which satisfy the following properties for a certain \(t_2 \in \{1,2,4\}\):(i) every line is incident with precisely three points;(ii) for every point \(x\), there exists a point \(y\) at distance \(3\) from \(x\);(iii) every two points at distance \(2\) from each other have either \(1\) or \(t_2 + 1\) common neighbours;(iv) every quad is big. As a corollary, we obtain a classification of all finite near hexagons satisfying (i), (ii) and (iii) with \(t_2\) equal to \(4\).

Lihua Feng1
1School of Mathematics, Shandong Institute of Business and Technology 191 Binhaizhong Road, Yantai, Shandong, P.R. China, 264005.
Abstract:

In this paper, we obtain the largest Laplacian spectral radius for bipartite graphs with given matching number and use them to characterize the extremal general graphs.

Bing Yao1, Ming Yao2, Hui Cheng1
1College of Mathematics and Information Science, Northwest Normal University, Lanzhou, 730070, P.R.China
2Department of Information Process and Control Engineering, Lanzhou Petrochemical College of Vocational Technology, Lanzhou, 730060, P.R.China
Abstract:

For integers \(k, \theta \leq 3\) and \(\beta \geq 1\), an integer \(k\)-set \(S\) with the smallest element \(0\) is a \((k; \beta, \theta)\)-free set if it does not contain distinct elements \(a_{i,j}\) (\(1 \leq i \leq j \leq \theta\)) such that \(\sum_{j=1}^{\theta -1}a_{i ,j} = \beta a_{i_\theta}\). The largest integer of \(S\) is denoted by \(\max(S)\). The generalized antiaverage number \(\lambda(k; \beta, \theta)\) is equal to \(\min\{\max(S) : S \text{ is a } (k^0; \delta, 0)\text{-free set}\}\). We obtain:(1) If \(\beta \notin \{\theta-2, \theta-1, \theta\}\), then \(\lambda(m; \beta, \theta) \leq (\theta-1)(m-2) + 1\); (2) If \(\beta \geq {\theta-1}\), then \(\lambda(k; \beta, \theta) \leq \min\limits_{k=m+n}\{\lambda(m;\beta,\theta)+\beta \lambda (n;\beta,\theta)+1\}\), where \(k =m+n \) with \(n>m\geq 3\) and \(\lambda(2n;\beta,\theta)\leq \lambda(n;\beta,\theta)(\beta+1)+\varepsilon\), for \(\varepsilon=1\) for \(\theta=3\) and \(\varepsilon=0\) otherwise.

Kathleen A.McKeon1
1Connecticut College
Abstract:

A connected graph is highly irregular if the neighbors of each vertex have distinct degrees. We will show that every highly irregular tree has at most one nontrivial automorphism. The question that motivated this work concerns the proportion of highly irregular trees that are asymmetric, i.e., have no nontrivial automorphisms. A \(d\)-tree is a tree in which every vertex has degree at most \(d\). A technique for enumerating unlabeled highly irregular \(d\)-trees by automorphism group will be described for \(d \geq 4\) and results will be given for \(d = 4\). It will be shown that, for fixed \(d\), \(d \geq 4\), almost all highly irregular \(d\)-trees are asymmetric.

Duanfeng Liu1,2, Xinru Liu1
1Department of Mathematics Science and Computer Technology,Central South University, Changsha 410083,P.R.China
2Department of Applied Mathematics,Guangdong University of Technology, Guangzhou 510006,P.R.China
Abstract:

Combining with specific degrees or edges of a graph, this paper provides some new classes of upper embeddable graphs and extends the results in [Y. Huang, Y. Liu, Some classes of upper embeddable graphs, Acta Mathematica Scientia, \(1997, 17\)(Supp.): \(154-161\)].

Ligong Wang1, Xiaodong Liu2
1Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, P.R.China
2School of Information, Xi’an University of Finance and Economics, Xi’an, Shaanxi 710061, P.R.China
Abstract:

A graph is called integral if all eigenvalues of its adjacency matrix are integers. In this paper, we investigate integral trees \(S(r;m_i) = S(a_1+a_2+\cdots+a_s;m_1,m_2,\ldots,m_s)\) of diameter \(4\) with \(s = 2,3\). We give a better sufficient and necessary condition for the tree \(S(a_1+a_2;m_1,m_2)\) of diameter \(4\) to be integral, from which we construct infinitely many new classes of such integral trees by solving some certain Diophantine equations. These results are different from those in the existing literature. We also construct new integral trees \(S(a_1+a_2+a_3;m_1,m_2,m_3) = S(a_1+1+1;m_1,m_2,m_3)\) of diameter \(4\) with non-square numbers \(m_2\) and \(m_3\). These results generalize some well-known results of P.Z. Yuan, D.L. Zhang \(et\) \(al\).

Jianxiu Hao1
1Institute of Mathematics, Physics and Information Sciences, Zhejiang Normal University, P.O. Box: 321004, Jinhua, Zhejiang, P.R. China;
Abstract:

Zagreb indices are the best known topological indices which reflect certain structural features of organic molecules. In this paper we point out that the modified Zagreb indices are worth studying and present some results about product graphs.

Haiying Li, Tianshui Ma1
1College of Mathematics and Information Science, Henan Normal Univ., Xinxiang 453007, P.R.China.
Abstract:

Let \(g \in H(\mathcal{B})\), \(g(0) = 0\) and \(\varphi\) be a holomorphic self-map of the unit ball \(\mathbb{B}\) in \(\mathbb{C}^n\). The following integral-type operator

\[I_\varphi^g(f)(z) = \int_{0}^{1} {\mathcal{R}f(\varphi(tz))}{g(tz)}\frac{ dt}{t}, \quad f \in H(\mathbb{B}),z\in \mathbb{B},\]

was recently introduced by S. Stević and studied on some spaces of holomorphic functions on \(\mathbb{B}\), where \(\mathcal{R}f(z) = \sum_{k=1}^n z_k \frac{\partial f}{\partial z_k}(z)\) is the radial derivative of \(g\). The boundedness and compactness of this operator from generally weighted Bloch spaces to Bloch-type spaces on \(\mathbb{B}\) are investigated in this note.

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;