Order-sensitive domination in partially ordered sets and graphs

DOI10.1007/s11083-022-09599-2zbMath1521.05138arXiv2007.04715MaRDI QIDQ6105038

Mehmet Akif Yetim, Yusuf Civan, Zakir Deniz

Publication date: 26 June 2023

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

partially ordered setcomparabilitydominationRoman dominationbiclique vertex-partitionorder-sensitive

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Covering graphs with few complete bipartite subgraphs
• Eigenvalues and expanders
• Roman domination in graphs.
• Weakly Triangulated Comparability Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order-sensitive domination in partially ordered sets and graphs