Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Rocío Sánchez-López"'
Autor:
Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocío Sánchez-López, Carlos Vilchis-Alfaro
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 74-81 (2024)
Externí odkaz:
https://doaj.org/article/85f98e93c11b4d4d886f14b1277e484f
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1014-1020 (2020)
Let D be a digraph and and two subsets of where = {P: P is a non trivial finite path in D}. A subset N of V(D) is said to be an ()-kernel of D if: (1) for every {u,v} N there exists no uv-path P such that P (N is -independent), (2) for every vertex x
Externí odkaz:
https://doaj.org/article/7dd1223628d346fc830f9a402d5a4f76
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 862-869 (2020)
Let be a digraph and S a subset of vertices of D, S is an absorbent set if for every v in there exists a vertex u in S such that A subset S of V(D) is a semicomplete absorbent set if S is absorbent and the induced subdigraph is semicomplete. The mini
Externí odkaz:
https://doaj.org/article/f1f2289648d54610a800fb5c8218d842
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 3, Pp 284-290 (2019)
Let D = (V(D), A(D)) a digraph. Consider the set PD= {P : P is a non trivial finite directed path in D} and let A and ℬ two subsets of PD. A subset N of V(D) is said to be an (A, ℬ)-kernel of D if (1) for every subset {u, v} of N there exists no
Externí odkaz:
https://doaj.org/article/e1858789ad04480b80e51a044b6fbd28
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 3, Pp 291-299 (2019)
Let be a digraph possibly with loops and a digraph without loops whose arcs are colored with the vertices of ( is said to be an -colored digraph). A directed walk in is said to be an -walk if and only if the consecutive colors encountered on form a d
Externí odkaz:
https://doaj.org/article/e69c5b13e7d246af8b1bba0106c0cad7
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 3, Pp 284-290 (2019)
Let = ( (), ()) a digraph. Consider the set = { : is a non trivial finite directed path in } and let and two subsets of . A subset of () is said to be an (, )-kernel of if (1) for every subset {, } of there exists no -directed path such that ( is -in
Externí odkaz:
https://doaj.org/article/9f96ebcbb03845ab88d465f0405a21f1
Autor:
Rocío Sánchez-López
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 2, Pp 165-171 (2017)
Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a suc
Externí odkaz:
https://doaj.org/article/c1619bf3aff34b8b905f6ca82efc5387
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 120-129 (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. For an arc (z1,z2) of D
Externí odkaz:
https://doaj.org/article/31442f60d6b8498d82c56627c8a4cf95
Publikováno v:
Discrete Applied Mathematics. 304:352-364
Let H be a digraph possibly with loops and D a digraph without loops with a coloring of its arcs c : A ( D ) → V ( H ) ( D is said to be an H -colored digraph). A directed path W in D is said to be an H -path if and only if the consecutive colors e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ba9bb607e7d168b932e82c92323695
https://doi.org/10.1016/j.dam.2021.08.004
https://doi.org/10.1016/j.dam.2021.08.004
Autor:
Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López, Juana Imelda Villarreal-Valdés
Publikováno v:
Graphs and Combinatorics. 38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e37bbc6a29f71646b4bf53f14442368
https://doi.org/10.1007/s00373-022-02464-4
https://doi.org/10.1007/s00373-022-02464-4