Results 1 to 10 of about 175,356 (25)
Packing Strong Subgraph in Digraphs [PDF]
arXiv, 2021 In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as generalizations of the famous Steiner tree packing problem and are closely related to the strong arc decomposition problem.
arxiv
Correction to: Criteria for Strong and Weak Random Attractors [PDF]
arXiv, 2023 In the article 'Criteria for Strong and Weak Random Attractors' necessary and sufficient conditions for strong attractors and weak attractors are studied. In this note we correct two of its theorems on strong attractors.
arxiv
Construction of Strong-Uniform Fuzzy Partitions of Arbitrary Dimensions [PDF]
arXiv, 2022 Strong-uniform fuzzy partition is necessary for the accuracy of fuzzy partition-based histograms. Most previous research focused on constructing one-dimensional strong-uniform fuzzy partitions. While to the best of our knowledge, few have been reported for high-dimensional cases.
arxiv
On Strong A-statistical Convergence in Probabilistic Metric Spaces [PDF]
arXiv, 2022 In this paper we study some basic properties of strong A-statistical convergence and strong A-statistical Cauchyness of sequences in probabilistic metric spaces not done earlier. We also study some basic properties of strong A-statistical limit points and strong A-statistical cluster points of a sequence in a probabilistic metric space. Further we also
arxiv
Capacity Region of $K$-User Discrete Memoryless Interference Channels with a Mixed Strong-Very Strong Interference [PDF]
arXiv, 2011 The capacity region of the 3-user Gaussian Interference Channel (GIC) with mixed strong-very strong interference was established in \cite{ChS}. The mixed strong-very strong interference conditions considered in \cite{ChS} correspond to the case where, at each receiver, one of the interfering signals is strong and the other is very strong. In this paper,
arxiv
On strong $\mathcal{A}^{\mathcal{I}}$-statistical convergence of sequences in probabilistic metric spaces [PDF]
arXiv, 2022 In this paper using a non-negative regular summability matrix $\mathcal{A}$ and a non-trivial admissible ideal $\mathcal{I}$ in $\mathbb{N}$ we study some basic properties of strong $\mathcal{A}^{\mathcal{I}}$-statistical convergence and strong $\mathcal{A}^{\mathcal{I}}$-statistical Cauchyness of sequences in probabilistic metric spaces not done ...
arxiv
Strong 2.t and Strong 3.t Transformations for Strong M-equivalence [PDF]
arXiv, 2017 Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the alphabet, strong M-equivalence was proposed as an order-independent alternative to M-equivalence in studying words possessing the same Parikh matrix.
arxiv
Strong cliques in diamond-free graphs [PDF]
arXiv, 2020 A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural and algorithmic points of view.
arxiv
Strong domatic number of a graph [PDF]
arXiv, 2023 A set $D$ of vertices of a simple graph $G=(V,E)$ is a strong dominating set, if for every vertex $x\in \overline{D}=V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number $\gamma_{st}(G)$ is defined as the minimum cardinality of a strong dominating set.
arxiv
Strong arc decompositions of split digraphs [PDF]
arXiv, 2023 A {\bf strong arc decomposition} of a digraph $D=(V,A)$ is a partition of its arc set $A$ into two sets $A_1,A_2$ such that the digraph $D_i=(V,A_i)$ is strong for $i=1,2$. Bang-Jensen and Yeo (2004) conjectured that there is some $K$ such that every $K$-arc-strong digraph has a strong arc decomposition.
arxiv