Dominator colorings of digraphs
ODMA-Vol. 3 (2020), Issue 2, pp. 50 – 67 Open Access Full-Text PDF
Michael Cary
Abstract: This paper serves as the first extension of the topic of dominator colorings of graphs to the setting of digraphs. We establish the dominator chromatic number over all possible orientations of paths and cycles. In this endeavor we discover that there are infinitely many counterexamples of a graph and subgraph pair for which the subgraph has a larger dominator chromatic number than the larger graph into which it embeds. Most importantly, we use these results to characterize all digraph families for which the dominator chromatic number is two. Finally, a new graph invariant measuring the difference between the dominator chromatic number of a graph and the chromatic number of that graph is established and studied. The paper concludes with some of the possible avenues for extending this line of research.
Numerical analysis of least squares and perceptron learning for classification problems
ODAM-Vol. 3 (2020), Issue 2, pp. 30 – 49 Open Access Full-Text PDF
Larisa Beilina
Abstract: This work presents study on regularized and non-regularized versions of perceptron learning and least squares algorithms for classification problems. The Fréchet derivatives for least squares and perceptron algorithms are derived. Different Tikhonov’s regularization techniques for choosing the regularization parameter are discussed. Numerical experiments demonstrate performance of perceptron and least squares algorithms to classify simulated and experimental data sets.
A new recursion for Bressoud’s polynomials
ODAM-Vol. 3 (2020), Issue 2, pp. 23 – 29 Open Access Full-Text PDF
Helmut Prodinger
Abstract: A new recursion in only one variable allows very simple verifications of Bressoud’s polynomial identities, which lead to the Rogers-Ramanujan identities. This approach might be compared with an earlier approach due to Chapman. Applying the \(q\)-Chu-Vandermonde convolution, as suggested by Cigler, makes the computations particularly simple and elementary. The same treatment is also applied to the Santos polynomials and perhaps more polynomials from a list of Rogers-Ramanujan like polynomials [1].
Reinterpreting the middle-levels theorem via natural enumeration of ordered trees
ODAM-Vol. 3 (2020), Issue 2, pp. 8 – 22 Open Access Full-Text PDF
Italo Jose Dejter
Abstract: Let \(0< k\in\mathbb{Z} \). A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph \(M_k\) induced by the vertices of the \((2k+1)\)-cube representing the \(k\)- and \((k+1)\)-subsets of \(\{0,\ldots,2k\}\) is given via an associated dihedral quotient graph of \(M_k\) whose vertices represent the ordered (rooted) trees of order \(k+1\) and size \(k\).
Total dominator chromatic number of graphs with specific construction
ODAM-Vol. 3 (2020), Issue 2, pp. 1 – 7 Open Access Full-Text PDF
Saeid Alikhani, Nima Ghanbari
Abstract: Let \(G\) be a simple graph. A total dominator coloring of \(G\) is a proper coloring of the vertices of \(G\) in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number \(\chi_d^t(G)\) of \(G\) is the minimum number of colors among all total dominator coloring of \(G\). In this paper, we study the total dominator chromatic number of some graphs with specific construction. Also we compare \(\chi_d^t(G)\) with \(\chi_d^t(G-e)\), where \(e\in E(G)\).