Order-Sensitive Domination in Partially Ordered Sets and Graphs
dc.authorid | Deniz, Zakir/0000-0002-0701-0397 | |
dc.authorid | Yetim, Mehmet Akif/0000-0002-3482-5137 | |
dc.authorwosid | Deniz, Zakir/AAK-6689-2021 | |
dc.authorwosid | Yetim, Mehmet Akif/AAV-5238-2021 | |
dc.contributor.author | Civan, Yusuf | |
dc.contributor.author | Deniz, Zakir | |
dc.contributor.author | Yetim, Mehmet Akif | |
dc.date.accessioned | 2023-07-26T11:57:38Z | |
dc.date.available | 2023-07-26T11:57:38Z | |
dc.date.issued | 2022 | |
dc.department | DÜ, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
dc.description.abstract | For a (finite) partially ordered set (poset) P, we call a dominating set D in the comparability graph of P, an order-sensitive dominating set in P if either x is an element of D or else a < x < b in P for some a,b is an element of D for every element x in P which is neither maximal nor minimal, and denote by gamma(os)(P), the least size of an order-sensitive dominating set of P. For every graph G and integer k >= 2, we associate to G a graded poset P-k(G) of height k, and prove that gamma(os)(P-3(G)) = gamma(R)(G) and gamma(os)(P-4(G)) = 2 gamma(G) hold, where gamma(G) and gamma(R)(G) are the domination and Roman domination number of G respectively. Moreover, we show that the order-sensitive domination number of a poset P exactly corresponds to the biclique vertex-partition number of the associated bipartite transformation of P. | en_US |
dc.identifier.doi | 10.1007/s11083-022-09599-2 | |
dc.identifier.issn | 0167-8094 | |
dc.identifier.issn | 1572-9273 | |
dc.identifier.scopus | 2-s2.0-85128886582 | en_US |
dc.identifier.scopusquality | Q3 | en_US |
dc.identifier.uri | https://doi.org/10.1007/s11083-022-09599-2 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12684/13256 | |
dc.identifier.wos | WOS:000794894800001 | en_US |
dc.identifier.wosquality | Q4 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.institutionauthor | Deniz, Zakir | |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Order-A Journal on The Theory of Ordered Sets and Its Applications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.snmz | $2023V1Guncelleme$ | en_US |
dc.subject | Domination; Partially Ordered Set; Order-Sensitive; Comparability; Roman Domination; Biclique Vertex-Partition | en_US |
dc.title | Order-Sensitive Domination in Partially Ordered Sets and Graphs | en_US |
dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 13256.pdf
- Boyut:
- 641.04 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin / Full Text