Results 11 to 20 of about 28,427 (196)
Journal of Combinatorial Theory, Series B, 2017 An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that it is NP-complete to decide whether two vertices $x,y$ in a digraph are connected by an antidirected path, while one can decide
Bang-Jensen, Jørgen +3 more
openaire +4 more sources
Digraph Decompositions and Monotonicity in Digraph Searching [PDF]
Theoretical Computer Science, 2008 We consider monotonicity problems for graph searching games. Variants of these games - defined by the type of moves allowed for the players - have been found to be closely connected to graph decompositions and associated width measures such as path- or tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the
Kreutzer, S, Ordyniak, S
openaire +4 more sources
Generalized Neutrosophic Competition Graphs [PDF]
Neutrosophic Sets and Systems, 2020 The generalized neutrosophic graph is a generalization of the neutrosophic graph that represents a system perfectly. In this study, the concept of a neutrosophic digraph, generalized neutrosophic digraph and out-neighbourhood of a vertex of a ...
Kousik Das, Sovan Samanta, Kajal De
doaj +1 more source
Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph [PDF]
Transactions on Combinatorics, 2019 For a simple connected graph $G$ with $n$ vertices and $m$ edges, let $\overrightarrow{G}$ be a digraph obtained by giving an arbitrary direction to the edges of $G$.
Hilal A. Ganie
doaj +1 more source
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meister, Daniel, Telle, Jan Arne
openaire +1 more source
On some subclasses of interval catch digraphs
Electronic Journal of Graph Theory and Applications, 2022 A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, pv)) in such a way that uv ∈ E if and only if pv ∈ Iu. It was introduced by Maehara in 1984.
Sanchita Paul, Shamik Ghosh
doaj +1 more source
The non-negative spectrum of a digraph
Open Mathematics, 2020 Given the adjacency matrix A of a digraph, the eigenvalues of the matrix AAT constitute the so-called non-negative spectrum of this digraph. We investigate the relation between the structure of digraphs and their non-negative spectra and associated ...
Alomari Omar +2 more
doaj +1 more source
Switching Reconstruction of Digraphs [PDF]
, 2013 Switching about a vertex in a digraph means to reverse the direction of every edge incident with that vertex. Bondy and Mercier introduced the problem of whether a digraph can be reconstructed up to isomorphism from the multiset of isomorphism types of ...
McKay, Brendan D., Schweitzer, Pascal
core +3 more sources
Proceedings of the American Mathematical Society, 2016 A majority digraph is a finite simple digraph G = ( V , → ) G=(V,\to ) such that there exist finite sets A v A_v for the vertices v ∈ V v\in V with the following property: u → v
Lai, Tri +2 more
openaire +4 more sources