Related papers: On weak majority dimensions of digraphs
An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…
A digraph $H$ is a ``semi-strong minor'' of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of ``plane''…
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…
At least two different notions have been published under the name "majority domination in graphs": Majority dominating functions and majority dominating sets. In this work we extend the former concept to digraphs. Given a digraph $D=(V,A),$…
In this article we introduce the {\it cylindrical construction} for graphs and investigate its basic properties. We state a main result claiming a weak tensor-like duality for this construction. Details of our motivations and applications…
This is my dissertation about digraphs ordered by pp-constructability. We study in particular smooth digraphs, i.e., digraphs without sources or sinks, tournaments and semicomplete digraphs, orientations of paths and cycles, digraphs with…
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…
We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique string to each vertex such that there is an arc from x to y if…
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of the inner diameter and inner radius of a digraph and study…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which adjacent vertices have different degrees. The connected…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
This paper serves as the first extension of the topic of dominator colorings of graphs to the setting of digraphs. We establish the dominator chromatic number over all possible orientations of paths and cycles. In this endeavor we discover…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has…
Let $G = (V, E)$ be a simple undirected connected graph. A set $C \subseteq V(G)$ is weakly convex in $G$ if for every two vertices $u,v$ in $G$, there exists a $u-v$ geodesic whose vertices are in $C$. A set $C \subseteq V$ is an…
L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…
Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct…
The dichromatic number $\vec{\chi}(G)$ of a digraph $G$ is the least integer $k$ such that $G$ can be partitioned into $k$ acyclic digraphs. A digraph is $k$-dicritical if $\vec{\chi}(G) = k$ and each proper subgraph $H$ of $G$ satisfies…