相关论文: Domination and regularity
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.
We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage…
We discuss various aspects of the statistical formulation of the theory of random graphs, with emphasis on results obtained in a series of our recent publications.
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
For a stationary sequence that is regularly varying and associated we give conditions which guarantee that partial sums of this sequence, under normalization related to the exponent of regular variation, converge in distribution to a…
We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…
We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…
In this paper we introduce a new property for normed algebras. This property which we call it stability, plays a key role in the studying of the theory of almost multiplier maps. In this note we study some of the basic properties of this…
The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a…
This paper studies the structural controllability of a class of uncertain switched linear systems, where the parameters of subsystems state matrices are either unknown or zero. The structural controllability is a generalization of the…
We develop a method to calculate the persistent currents and their spatial distribution (and transport properties) on graphs made of quasi-1D diffusive wires. They are directly related to the field derivatives of the determinant of a matrix…
We develop a general theory of local stability up to belonging to an ideal (e.g. having measure zero). From a model-theoretic perspective, we prove a stationarity principle for almost stable formulas in this sense, and build a topological…
We study the notion of structured realizability for linear systems defined over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the…
This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.
In this paper we aim to present two general results regarding, on one hand, the openness stability of set-valued maps and, on the other hand, the metric regularity behavior of the implicit multifunction related to a generalized variational…
A set $S$ of vertices of a graph $G$ is a dominating set in $G$ if every vertex outside of $S$ is adjacent to at least one vertex belonging to $S$. A domination parameter of $G$ is related to those sets of vertices of a graph satisfying…
The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs…
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an…
A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…