Related papers: Weak Dominance Drawings and Linear Extension Diame…
We propose a weak form of domination, called partially dominated splitting and the main result is that there is a partially dominated splitting over a nonsingular compact invariant set for a flow if, and only if, the associated linear…
It was shown by Grohe et al. that nowhere dense classes of graphs admit sparse neighbourhood covers of small degree. We show that a monotone graph class admits sparse neighbourhood covers if and only if it is nowhere dense. The existence of…
The notion of weak cyclic monotonicity of set-valued maps generalizing the cyclic monotonicity is introduced. The existence of solutions of differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides…
The paper introduces notions of robustness margins geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and in engineering, a theory of robustness for behaviors away from…
In this paper, we classify all commutative weakly distance-regular digraphs of girth $g$ and one type of arcs under the assumption that $p_{(1,g-1),(1,g-1)}^{(2,g-2)}\geq k_{1,g-1}-2$. In consequence, we recover [13, Theorem 1.1] as a…
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number…
We discuss the divergence problems recently identified in some extrapolation operators for weakly-relational numeric domains. We identify the cause of the divergences and point out that resorting to more concrete, syntactic domains can be…
In this article we consider the linear elasticity problem in an axisymmetric three dimensional domain, with data which are axisymmetric and have zero angular component. The weak formulation of the the three dimensional problem reduces to a…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
We give characterizations for the failure of form uniqueness on weakly spherically symmetric graphs. The first characterization is in terms of the graph structure, the second involves the capacity of a Cauchy boundary. We also discuss the…
We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,{\Gamma}_H )$ be a partial orthogonal drawing, i.e., G is a graph, $H\subseteq G$ is a subgraph and ${\Gamma}_H$ is a planar…
We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire…
We study the regularity of weak solutions to evolution equations with distributed order fractional time derivative. We prove a weak Harnack inequality for nonnegative weak supersolutions and H\"older continuity of weak solutions to this…
We study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.
This paper deals with the interplay of the geometry of the norm and the weak topology in Banach spaces. Both dual and intrinsic connections between weak forms of rotundity and smoothness ared discussed. Weakly exposed points, weakly locally…
In this review we present some recent extensions of the method of the weakly conjugate operator. We illustrate these developments through examples of operators on graphs and groups.
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating $2$-broadcasts along with the associated…
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs.…