Results 21 to 30 of about 1,088 (61)
, 2018 A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the digraph has a kernel (does not have a kernel resp.).
Galeana-Sánchez, H., Olsen, M.
core +1 more source
Connectedness of two-sided group digraphs and graphs
, 2017 Two-sided group digraphs and graphs, introduced by Iradmusa and Praeger, provide a generalization of Cayley digraphs and graphs in which arcs are determined by left and right multiplying by elements of two subsets of the group.
Chikwanda, Patreck +5 more
core +1 more source
Priors on exchangeable directed graphs
, 2016 Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter.
Ackerman, Nathanael +2 more
core +1 more source
Automatic closure of invariant linear manifolds for operator algebras [PDF]
, 2000 Kadison's transitivity theorem implies that, for irreducible representations of C*-algebras, every invariant linear manifold is closed. It is known that CSL algebras have this propery if, and only if, the lattice is hyperatomic (every projection is ...
Donsig, Allan +2 more
core +2 more sources
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
, 2007 For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a ...
Gupta, A. +4 more
core +2 more sources
Revealed Cores: Characterizations and Structure [PDF]
Characterizations of the choice functions that select the cores or the externally stable cores induced by an underlying revealed dominance digraph are provided.
Stefano Vannucci
core
Notes on the connectivity of Cayley coset digraphs
, 1993 Hamidoune's connectivity results for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs.
Knill, Emanuel
core +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
A new family of posets generalizing the weak order on some Coxeter groups
, 2015 We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order on the wreath ...
Viard, François
core +2 more sources