Results 101 to 110 of about 34,890 (227)
Strongly chordal digraphs and $\Gamma$-free matrices. [PDF]
Pavol Hell +3 more
openalex +1 more source
Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs [PDF]
Wu Shaochuan, Michael Rabbat
openalex +1 more source
Normally Regular Digraphs [PDF]
A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$, a pair of non-adjacent vertices have $\mu$ common out-neighbours, a pair of vertices connected by an edge in one ...
openaire +4 more sources
On k-geodetic digraphs with excess one
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from u to v. If the diameter of G is k, we say that G is strongly geodetic.
Anita Abildgaard Sillasen
doaj +1 more source
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs [PDF]
Kristóf Bérczi, András Frank
openalex +1 more source
Let D be a digraph. A path partition P of D is a collection of paths such that {V(P) : P ∈ P} is a partition of V(D). We say D is α-diperfect if for every maximum stable set S of D there exists a path partition P of D such that |S ∩ V (P )| = 1 for all P ∈ P and this property holds for every induced subdigraph of D.
M. Sambinelli, C. Nunes da Silva, O. Lee
openaire +2 more sources
Algebraic degrees of quasi-abelian semi-Cayley digraphs [PDF]
Shixin Wang, Majid Arezoomand, Tao Feng
openalex +1 more source
A Note on Some Generalized Closed Sets in Bitopological Spaces Associated to Digraphs
Many investigations are undergoing of the relationship between topological spaces and graph theory. The aim of this short communication is to study the nature and properties of some generalized closed sets in the bitopological spaces associated to the ...
K. Kannan
doaj +1 more source
Boolean percolation on digraphs and random exchange processes [PDF]
Georg Braun
openalex +1 more source
A Classification of Isomorphism-Invariant Random Digraphs [PDF]
Selim Bahadır, Elvan Ceyhan
openalex +1 more source

