相关论文: On weak majority dimensions of digraphs

A subset $S$ of vertices of a digraph $D$ is a double dominating set (total $2$-dominating set) if every vertex not in $S$ is adjacent from at least two vertices in $S$, and every vertex in $S$ is adjacent from at least one vertex in $S$…

A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals…

The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…

Let (X,dX) and (Y,dY) be semimetric spaces with distance sets D(X) and, respectively, D(Y). A mapping F : X \to Y is a weak similarity if it is surjective and there exists a strictly increasing f : D(Y) \to D(X) such that dX = f \circ dY…

Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some…

The digirth of a digraph is the length of a shortest directed cycle. The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the smallest size of a partition of the vertex-set into subsets inducing acyclic subgraphs. A conjecture by…

We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…

Let $G=(V,E)$ be a graph. For some $\alpha$ with $0<\alpha \leq 1$, a subset $S$ of $V$ is said to be a $\alpha$-partial dominating set if $|N[S]|\geq \alpha |V|$. The size of a smallest such $S$ is called the $\alpha$-partial domination…

We study the directed maximum common edge subgraph problem (DMCES) for the class of directed graphs that are finite, weakly connected, oriented, and simple. We use DMCES to define a metric on partially ordered sets that can be represented…

Using probabilistic ideas, we prove that the packing dimension of a mean porous measure is strictly smaller than the dimension of the ambient space. Moreover, we give an explicit bound for the packing dimension, which is asymptotically…

The main purpose of this short article is to give a brief overview of the development of the very interesting weak measurement protocol. I add some comments relating to the reality of weak values, and also comment on the allowed values of…

The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function over the cut dominant is equivalent to finding a minimum…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We deal with a notion of weak binormal and weak principal normal for non-smooth curves of the Euclidean space with finite total curvature and total absolute torsion. By means of piecewise linear methods, we first introduce the analogous…

Following recent work on the VC-dimension of subsets of various pseudorandom graphs, we study the VC-dimension of Hamming graphs, which have proved somewhat resistant to the standard techniques in the literature. Our methods are elementary,…

A weak measurement consists in coupling a system to a probe in such a way that constructive interference generates a large output. So far, only the average output of the probe and its variance were studied. Here, the characteristic function…

In this paper, we investigate the relationship between the weak min-max property and the diameter uniformity of domains in Banach spaces with dimensions at least $2$. As an application, we show that diameter uniform domains are invariant…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

Given a directed graph $D$, a set $S \subseteq V(D)$ is a total dominating set of $D$ if each vertex in $D$ has an in-neighbor in $S$. The total domination number of $D$, denoted $\gamma_t(D)$, is the minimum cardinality among all total…

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…