Results 21 to 30 of about 6,654 (223)
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.
Daniel Meister 0001, Jan Arne Telle
openaire +1 more source
Double vertex digraphs of digraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yubin Gao, Yanling Shao
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
Dr. Lee Chia Kuang invents new software Dematel Digraph [PDF]
, 2021 A lecturer from the Faculty of Industrial Management (FPI), Universiti Malaysia Pahang (UMP), Dr.
Safriza, Baharuddin +1 more
core
Journal of Combinatorial Theory, Series B, 1993 We introduce a generalization of digraphs that are local tournaments. This is the class of in-tournament digraphs---the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs.
Jørgen Bang-Jensen +2 more
openaire +1 more source
Dr. Lee Chia Kuang cipta perisian baharu Dematel Digraph [PDF]
, 2021 Penyelidik dari Fakulti Pengurusan Industri (FPI), Universiti Malaysia Pahang (UMP), Dr.
Safriza, Baharuddin +1 more
core
THE ROMAN BONDAGE NUMBER OF A DIGRAPH [PDF]
, 2016 Let D=(V,A)D=(V,A) be a finite and simple digraph. A Roman dominating function on DD is a labeling f:V(D)→{0,1,2}f:V(D)→{0,1,2} such that every vertex with label 0 has an in-neighbor with label 2.
Sheikholeslami, Seyed Mahmoud;Dehgardi, Nasrin;Volkmann, Lutz;Meierling, Dirk +4 more
core +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
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Jean-Claude Bermond +3 more
openaire +2 more sources