H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2021 Let H be a digraph (possibly with loops) and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). For an arc (x, y) of D, its color is denoted by c(x, y). A directed path W = (v0, . .
Campero-Alonzo José Manuel +1 more
doaj +3 more sources
H-kernels by walks in H-colored digraphs and the color-class digraph
AKCE International Journal of Graphs and Combinatorics, 2016 Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Hortensia Galeana-Sánchez +1 more
doaj +2 more sources
Kernels by monochromatic paths and the color-class digraph
Discussiones Mathematicae Graph Theory, 2011 An m-coloured digraph is a digraph whose arcs are coloured with m colors. A directed path is monochromatic when its arcs are coloured alike. A set S ⊆ V (D) is a kernel by monochromatic paths whenever the two following conditions hold: 1. For any x, y ∈ S, x 6= y, there is no monochromatic directed path between them. 2.
openaire +3 more sources
New Bounds for the Dichromatic Number of a Digraph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The chromatic number of a graph $G$, denoted by $\chi(G)$, is the minimum $k$ such that $G$ admits a $k$-coloring of its vertex set in such a way that each color class is an independent set (a set of pairwise non-adjacent vertices).
Narda Cordero-Michel +1 more
doaj +1 more source
Kernels by Monochromatic Paths and Color-Perfect Digraphs
Discussiones Mathematicae Graph Theory, 2016 For a digraph D, V (D) and A(D) will denote the sets of vertices and arcs of D respectively. In an arc-colored digraph, a subset K of V(D) is said to be kernel by monochromatic paths (mp-kernel) if (1) for any two different vertices x, y in N there is no
Galeana-Śanchez Hortensia +1 more
doaj +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
Heuristic algorithms for best match graph editing. [PDF]
Algorithms Mol Biol, 2021 Schaller D +3 more
europepmc +1 more source
A Social Network Analysis Approach to Evaluate the Relationship Between the Mobility Network Metrics and the COVID-19 Outbreak. [PDF]
Health Serv Insights, 2023 Ilbeigipour S, Teimourpour B.
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
Merging Arcs to Produce Acyclic Phylogenetic Networks and Normal Networks. [PDF]
Bull Math Biol, 2022 Willson SJ.
europepmc +1 more source