About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs

DOI10.7151/dmgt.2104zbMath1415.05060OpenAlexW2963260278WikidataQ129722755 ScholiaQ129722755MaRDI QIDQ2312064

Hortensia Galeana-Sánchez, Camino Balbuena, Mucuy-kak Guevara

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2104

zbMATH Keywords

digraphskernelGrundy functionin-domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Kernels and partial line digraphs
• Perfect graphs, kernels, and cores of cooperative games
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• On the linegraph of a directed-graph
• Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
• Line Digraph Iterations and the (d, k) Digraph Problem
• (k,l)-kernels in line digraphs
• On (k,l)-kernels in D-join of digraphs
• Semikernels and (k,l)-Kernels in Digraphs
• The partial line digraph technique in the design of large interconnection networks

This page was built for publication: About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs