Results 31 to 40 of about 1,150 (71)
On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
Discussiones Mathematicae Graph Theory, 2014 Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V (D) − N there exists v ∈ N such that d(u, v)
Hell Pavol, Hernández-Cruz César
doaj +1 more source
Hamilton cycles in dense vertex-transitive graphs [PDF]
, 2014 A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large.
Alon +28 more
core +2 more sources
Linkages in locally semicomplete digraphs and quasi-transitive digraphs
Discrete Mathematics, 1999 A digraph is locally semicomplete if the out-set and in-set of each vertex are semicomplete, that is, any two vertices are joined by at least one edge. A digraph is quasi-transitive if, for each path \(xyz\), the digraph contains at least one of the edges \(xz\) or \(zx\).
openaire +2 more sources
Kernels by monochromatic paths in
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galeana-Sánchez, Hortensia +2 more
openaire +2 more sources
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
Discrete Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bang-Jensen, Jørgen +2 more
openaire +2 more sources
The structure of strong $k$-quasi-transitive digraphs with large diameters
, 2020 15 ...
Wang, Ruixia, Zhang, Hui
openaire +2 more sources
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
Discussiones Mathematicae Graph Theory, 2010 We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices of N there is no monochromatic path between them and for every vertex v / ∈ N there is a
Hortensia Galeana-Sánchez +2 more
openaire +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
Infinite quasi-transitive digraphs with domination number
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hortensia Galeana-Sánchez, Mika Olsen
openaire +2 more sources