strong connectedness
Recently Published Documents


TOTAL DOCUMENTS

22
(FIVE YEARS 7)

H-INDEX

6
(FIVE YEARS 2)

2022 ◽  
Vol 6 (1) ◽  
pp. 39
Author(s):  
Christoph Bandt ◽  
Dmitry Mekhontsev

Self-similar sets with the open set condition, the linear objects of fractal geometry, have been considered mainly for crystallographic data. Here we introduce new symmetry classes in the plane, based on rotation by irrational angles. Examples without characteristic directions, with strong connectedness and small complexity, were found in a computer-assisted search. They are surprising since the rotations are given by rational matrices, and the proof of the open set condition usually requires integer data. We develop a classification of self-similar sets by symmetry class and algebraic numbers. Examples are given for various quadratic number fields.


Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3079
Author(s):  
Mattia G. Bergomi ◽  
Massimo Ferri ◽  
Pietro Vertechi ◽  
Lorenzo Zuffi

Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and digraphs. We focus on categorical persistence functions that allow us to study in full generality strong kinds of connectedness—clique communities, k-vertex, and k-edge connectedness—directly on simple graphs and strong connectedness in digraphs.


Author(s):  
Xin Meng ◽  
Baoping Jiang ◽  
Cunchen Gao

This paper considers the Mittag-Leffler projective synchronization problem of fractional-order coupled systems (FOCS) on the complex networks without strong connectedness by fractional sliding mode control (SMC). Combining the hierarchical algorithm with the graph theory, a new SMC strategy is designed to realize the projective synchronization between the master system and the slave system, which covers the globally complete synchronization and the globally anti-synchronization. In addition, some novel criteria are derived to guarantee the Mittag-Leffler stability of the projective synchronization error system. Finally, a numerical example is given to illustrate the validity of the proposed method.


2019 ◽  
Vol 29 (5) ◽  
pp. 303-309
Author(s):  
Fedor M. Malyshev

Abstract The paper is concerned with systems of generators of permutation groups on Cartesian products of residue rings. Each separate permutation from the system of generators is constructed on the basis of additions, is characterized by the local action, and leaves fixed the major parts of the components of the element being transformed. A criterion of 2-transitivity of the generated permutation group is given in the form of the strong connectedness of the digraph which corresponds to the system of generators and which is defined on the set of numbers of residue rings in the Cartesian product. Necessary and sufficient conditions under which this group contains an alternating group are formulated.


Sign in / Sign up

Export Citation Format

Share Document