Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs

DOI10.1016/J.ENDM.2016.09.046zbMath1356.05060arXiv1601.07775OpenAlexW2532804814MaRDI QIDQ510598

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

Publication date: 13 February 2017

Full work available at URL: https://arxiv.org/abs/1601.07775

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)

Related Items (1)

Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels and partial line digraphs
• Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
• The partial line digraph technique in the design of large interconnection networks

This page was built for publication: Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs