Abstract
Let H be a digraph possibly with loops and D a digraph (possibly infinite) without loops whose arcs are coloured with the vertices of H (D is an H-coloured digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively. A directed walk or a directed path W in D is an H-walk or an H-path if and only if the consecutive colors encountered on W form a directed walk in H. A set \({N \subseteq V(D}\)) is an H-kernel if for every pair of different vertices in N there is no H-path between them, and for every vertex \({u \in V(D) \setminus N}\) there exists an H-path in D from u to N. Linek and Sands introduced the concept of H-walk and this concept was later used by several authors. In particular, Galeana-Sánchez and Delgado-Escalante used the concept of H-walk in order to introduce the concept of H-kernel, which generalizes the concepts of kernel and kernel by monochromatic paths. Let D be an arc-coloured digraph. In 2009 Galeana-Sánchez introduced the concept of color-class digraph of D, denoted by \({\fancyscript{C}_C(D),}\) as follows: the vertices of the color-class digraph are the colors represented in the arcs of D, and \({(i, j) \in A(\fancyscript{C}_C(D))}\) if and only if there exist two arcs namely (u, v) and (v, w) in D such that (u, v) has color i and (v, w) has color j. Since V \({(\fancyscript{C}_C(D)) \subseteq {\rm V}(H)}\) , the main question is: What structural properties of \({\fancyscript{C}_C(D),}\) with respect to H, imply that D has an H-kernel? Suppose that D has no infinite outward H-path. In this paper we prove that if \({\fancyscript{C}_C(D) \subseteq H}\) , then D has an H-kernel. We also prove that if there exists a partition (V 1, V 2) of V \({(\fancyscript{C}_C(D))}\) such that: (1) \({\fancyscript{C}_C(D)[V_i] \subseteq H[V_i]}\) for each i \({\in}\) {1,2}, (2) if \({(u, v) \in A(\fancyscript{C}_C(D))}\) for some \({u \in V_i}\) and for some \({v \in V_j}\) , with i ≠ j and \({i, j \in}\) {1,2}, then \({(u, v) \notin A(H),}\) and (3) D has no V i -colored infinite outward H-path for each i \({\in}\) {1,2}. Then D has an H-kernel. Several previous results are generalized.
Similar content being viewed by others
References
Arpin P., Linek V.: Reachability problems in edge-colored digraphs. Discrete Math. 307, 2276–2289 (2007)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)
Berge, C.: Graphs. North-Holland, Amsterdam (1989)
Boros, E., Gurvich, V.: Perfect graphs, kernels and cores of cooperative games. RUTCOR Research Report 12. Rutgers University, April 2003
Delgado-Escalante, P., Galeana-Sánchez, H.: Restricted domination in arc-colored digraphs. In preparation
Fraenkel, A.S.: Combinatorial games: selected bibliography with a succinct gourmet introduction. Electron. J. Combin. 14(DS2) (2009)
Galeana-Sánchez H.: On monochromatic paths and monochromatic cycles in edge coloured tournaments. Discrete Math. 156, 103–112 (1996)
Galeana-Sánchez H.: Kernels in edge coloured digraphs. Discrete Math. 184, 87–99 (1998)
Galeana-Sánchez H.: Kernels by monochromatic paths and the color-class digraph. Discuss. Math. Graph Theory 31, 273–281 (2011)
Galeana-Sánchez H., Rojas-Monroy R.: A counterexample to a conjecture on edge-colored tournaments. Discrete Math. 282, 275–276 (2004)
Galeana-Sánchez H., Sánchez-López R.: H-kernels in the D-join. Ars Combin. 98, 353–377 (2011)
Hahna G., Ille P., Woodrow R.E.: Absorbing sets in arc-coloured tournaments. Discrete Math. 283, 93–99 (2004)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs: advanced topics. Monographs and Textbooks in Pure and Applied Mathematics, vol. 209. Marcel Dekker, New York (1998)
Linek V., Sands B.: A note on paths in edge-colored tournaments. Ars Combin. 44, 225–228 (1996)
Minggang S.: On monochromatic paths in m-coloured tournaments. J. Combin. Theory Ser. B 45, 108–111 (1988)
Neumann, J. V., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)
Reid K.B.: Monotone reachability in arc-colored tournaments. Congr. Numer. 146, 131–141 (2000)
Rojas-Monroy R., Villarreal-Valdés J.I.: Kernels in infinite digraphs. AKCE J. Graphs. Combin. 7(1), 103–111 (2010)
Sands B., Sauer N., Woodrow R.: On monochromatic paths in edge coloured digraphs. J. Combin. Theory Ser. B 33, 271–275 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Galeana-Sánchez, H., Sánchez-López, R. H-Kernels in Infinite Digraphs. Graphs and Combinatorics 29, 913–920 (2013). https://doi.org/10.1007/s00373-012-1150-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1150-6