Semicomplete absorbent sets in digraphs

DOI10.1016/j.akcej.2019.06.010zbMath1468.05099OpenAlexW3047912289MaRDI QIDQ4956182

Laura Pastrana Ramírez, Miguel Tecpa-Galván, Rocío Sánchez-López

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.06.010

zbMATH Keywords

compositiondominationabsorbentCartesiansemicomplete

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
• Kernels in infinite digraphs
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• Dominating sets in social network graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Total domination in graphs
• Dominating cliques in graphs

This page was built for publication: Semicomplete absorbent sets in digraphs