?
On the Number of Minimum Total Dominating Sets in Trees
Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций"). 2023. Vol. 17. No. 1. P. 213–224.
The minimum total dominating set (MTDS) of a graph is a vertex subset D of
minimum cardinality such that every vertex of the graph is adjacent to at least one vertex of D.
In this paper we obtain a sharp upper bound for the number of MTDSs in the class
of n-vertex 2-caterpillars. We also show that for all n ≥ 1 every n-vertex tree has less than (√2)^n MTDSs.
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Ivchenko A., Nigmatullin R. R., Dorokhin S. V., Mathematics 2021 Vol. 9 No. 4 Article 381
n this paper, we focus on the generalization of the Hurst empirical law and suggest a set of reduced parameters for quantitative description of long-time series. These series are usually considered as a specific response of a complex system (economic, geophysical, electromagnetic and other systems), where successive fixations of external factors become impossible. We consider ...
Added: June 27, 2026
Ivchenko A., Shestoperov A. I., Fomina E. V., Microgravity Science and Technology 2025 Vol. 37 No. 19 P. 1–19
The paper is dedicated to the analysis of medico-biological data obtained during locomotor testing of astronauts. Accurate data interpretation plays a crucial role in locomotion system monitoring, prophylaxis of long-duration spaceflight negative effects and thus in the development of an autonomous medical support system for deep space expeditions. During the locomotor testing the astronaut changes ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., 2023 3rd International Conference on Innovative Research in Applied Science, Engineering and Technology (IRASET) Mohammedia, Morocco 2023 P. 1–6
The article proposes the architecture for eventdriven Emergency Operation Center with Machine Vision Component. Sources of information are analyzed and approaches to machine vision events for tactical situations detection and estimation are discussed. Messages from Machine Vision Components are converted to Common Alerting Protocol and processed by Operation Center environment for tactical situations recognition. ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., Лукьянченко П. П., Computer Research and Modeling 2023 Vol. 15 No. 1 P. 129–140
In this article we propose a new approach to the analysis of econometric industry parameters for the industry consolidation level. The research is based on the simple industry automatic control model. The state of the industry is measured by quarterly obtained econometric parameters from each industry’s company provided by the tax control regulator. An approach ...
Added: June 26, 2026
Gadzhimirzaev S., Хельвас А. В., International Frequency Sensor Association (IFSA) Publishing, 19-21 February 2025 Granada, Spain 2025 P. 172–176
The paper presents models for an innovative fully robotic warehouse for storing boxed goods. A discrete multiagent simulation of the movement of shuttles in a warehouse for a given sequence of pallet shipments has been implemented. Different strategies for placement of boxes in various areas of a warehouse are evaluated, as well as optimal routing ...
Added: June 26, 2026
Fedorov Timofey, Moscow Mathematical Journal 2026 Vol. 26 No. 1 P. 73–85
We obtain a complete list of smooth projective threefolds over C for which the dimension of the space of vanishing cycles (in H2(Y,Q) of the smooth hyperplane section Y) equals 2. We also obtain a complete list of rank 2 very ample vector bundles E on smooth projective surfaces with c2(E)=3. ...
Added: June 25, 2026
Воронеж: Издательский дом ВГУ, 2026.
В сборнике представлены материалы докладов и лекций, включенных в программу весенней математической школы. ...
Added: June 25, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Gurvich V., Krnc M., Vyalyi M., Results in Mathematics 2025 Vol. 80 Article 117
An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length . This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is immortal if they are all infinite. We obtain some necessary and some ...
Added: August 24, 2025
Qian X., Guan X., Jia J. et al., Journal of Optimization Theory and Applications 2024 Vol. 200 P. 524–554
Given an undirected tree T = (V, E) and a value σ > 0, every edge e ∈ E has a lead time l(e) and a capacity c(e). Let Pst be the unique path connecting s and t. A transmission time of sending σ units data from s to t ∈ V is Q(s, t,σ) ...
Added: January 18, 2024
D. S. Taletskii, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 3 P. 664–677
The set of vertices of a graph is called distance-k independent if the distance between any two of its vertices is greater than some integer k ≥ 1. In this paper, we describe n-vertex trees with a given diameter d that have the maximum and minimum possible number of distance-k independent sets among all such ...
Added: November 8, 2023
Taletskii D., Дискретный анализ и исследование операций 2023 Т. 30 № 3 С. 111–131
The set of vertices of a graph is called distance-k independent if the distance between any two of its vertices is greater than some integer k ⩾ 1. In this paper we describe n-vertex trees with a given diameter d which have maximum and minimum possible number of distance-k independent sets among all such trees. The ...
Added: June 13, 2023
Zhang Q., Guan X., Jia J. et al., Journal of Global Optimization 2023 Vol. 86 P. 251–284
We consider the restricted inverse optimal value problem on shortest path under weighted l1 norm on trees (RIOVSPT1). It aims at adjusting some edge weights to minimize the total cost under weighted l1 norm on the premise that the length of the shortest root-leaf path of the tree is lower-bounded by a given value D, ...
Added: June 2, 2023
D. S. Taletskii, Mathematical notes 2023 Vol. 113 P. 552–566
The class of trees in which the degree of each vertex does not exceed an integer 𝑑 is considered. It is shown that, for 𝑑=4, each 𝑛-vertex tree in this class contains at most (√2)^𝑛 minimum dominating sets (MDS), and the structure of trees containing precisely (√2)^𝑛 MDS is described. On the other hand, for 𝑑=5, an 𝑛-vertex tree containing more than (1/3)⋅1.415^𝑛 MDS is ...
Added: April 25, 2023
Taletskii D., Математические заметки 2023 Т. 113 № 4 С. 577–595
The class of trees in which the degree of each vertex does not exceed an integer d is considered. It is shown that, for d = 4, each n-vertex tree in this class contains at most (√2)^n minimum dominating sets (MDS), and the structure of trees containing precisely (√2)^n MDS is described. On the other hand, ...
Added: April 25, 2023
Taletskii D., Дискретный анализ и исследование операций 2023 Т. 30 № 1 С. 110–129
The minimum total dominating set (MTDS) of a graph is a vertex subset D of minimum cardinality such that every vertex of the graph is adjacent to at least one vertex of D. In this paper we obtain the sharp upper bound for the number of MTDS in the class of n-vertex 2-caterpillars. We also show that ...
Added: November 15, 2022
Qian X., Guan X., Jia J. et al., Journal of Global Optimization 2023 Vol. 85 P. 461–485
In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex
quickest 1-center (VQ1C) problem on a tree, which aims to find a vertex such that the
maximum transmission time to transmit σ units data is minimum.We first characterize some
intrinsic properties of VQ1C and design a binary search algorithm in O(n log n) time ...
Added: July 23, 2022
Taletskii D., Malyshev D., Discrete Applied Mathematics 2022 Vol. 314 P. 321–330
For any n and l, we completely describe trees with the maximum and minimum numbers of maximal independent sets among all n-vertex trees with l leaves. ...
Added: March 30, 2022
Taletskii D., Discrete Mathematics 2022 Vol. 345 No. 1 Article 112656
In this paper we investigate the relation between the number of k-dominating sets and the number of independent sets in a tree. We call the k-interior of a tree T the forest that contains all the vertices of T of degree at least k. Heuberger and Wagner (2008) characterized for all n,d≥3 the n-vertex trees ...
Added: September 29, 2021
Taletskii D., Mathematical notes 2021 Vol. 109 P. 280–291
We consider the problem of describing 𝑛-vertex trees of diameter 𝑑 containing as few independent sets as possible. This problem is solved for 𝑑=6 and 𝑛>160, as well as for 𝑑=7 and 𝑛>400. ...
Added: September 20, 2021
Zhang Q., Guan X., Wang H. et al., Optimization Letters 2021 Vol. 15 P. 2661–2680
We consider the maximum shortest path interdiction problem by upgrading edges on
trees under Hamming distance (denoted by (MSPITH)), which has wide applications
in transportation network, networkwar and terrorist network. The problem (MSPITH)
aims to maximize the length of the shortest path from the root of a tree to all its leaves
by upgrading edge weights such that the ...
Added: January 12, 2021