Related papers: On weak majority dimensions of digraphs
Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\Gamma$. We first establish lower and upper bounds for the number of arcs in $\Gamma$ by using the diameter and weak metric…
The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P. We present complexity results and bounds.
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
A majority digraph is a finite simple digraph $G=(V,\to)$ such that there exist finite sets $A_v$ for the vertices $v\in V$ with the following property: $u\to v$ if and only if "more than half of the $A_u$ are $A_v$". That is, $u\to v$ if…
Weakly distance-regular digraphs is a directed version of distance-regular graphs. In this paper, we characterize all weakly distance-regular digraphs of diameter 2.
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…
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph.…
We prove a version of Bass' finitistic dimension conjecture for path algebras over arbitrary directed graphs. It is known that the path algebra of a finite directed graph is hereditary, hence it has finite finitistic dimension, when the…
The domination number of a graph $G$, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set of $G$. A vertex of a graph is called critical if its deletion decreases the domination number, and a graph is called critical if…
Let $k$ be an integer with $k\geq 2$. A digraph $D$ is $k$-quasi-transitive, if for any path $x_0x_1\ldots x_k$ of length $k$, $x_0$ and $x_k$ are adjacent. Suppose that there exists a path of length at least $k+2$ in $D$. Let $P$ be a…
For a finite simple graph $G$, say $G$ is of dimension $n$, and write $\dim(G) = n$, if $n$ is the smallest integer such that $G$ can be represented as a unit-distance graph in $\mathbb{R}^n$. Define $G$ to be \emph{dimension-critical} if…
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination…
In this paper, we study commutative weakly distance-regular digraphs whose attached association schemes are regular, and give a characterization of mixed arcs. As an application, we classify such digraphs of diameter 2.
Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\setminus S$ is connected.…
The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one thick end has infinite weak cop number. It follows that every…
A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $w\in W$, there is at least one element in $W-\{w\}$ that resolves $w$ and $v$ for every $v\in V(G)- W$.…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
This paper is devoted to the study of directed graphs with extremal properties relative to certain metric functionals. We characterize up to isomorphism critical digraphs with infinite values of diameter, quasi-diameter, radius and…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…