Results 31 to 40 of about 1,500 (66)
Homogeneous 2-partite digraphs [PDF]
, 2013 We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite digraphs.Comment:
Hamann, Matthias
core
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
Parameterized Algorithms for Directed Maximum Leaf Problems
, 2007 We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that includes all ...
Alon, Noga +4 more
core +4 more sources
Sombor index of directed graphs. [PDF]
Heliyon, 2022 Cruz R, Monsalve J, Rada J.
europepmc +1 more source
A new model for predicting the winner in tennis based on the eigenvector centrality. [PDF]
Ann Oper Res, 2023 Arcagni A, Candila V, Grassi R.
europepmc +1 more source
, 2005 A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all ...
Hemaspaandra, Edith +2 more
core +2 more sources
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
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
Binets: Fundamental Building Blocks for Phylogenetic Networks. [PDF]
Bull Math Biol, 2017 van Iersel L +3 more
europepmc +1 more source
Parameterized Complexity of Eulerian Deletion Problems. [PDF]
Algorithmica, 2014 Cygan M +4 more
europepmc +1 more source