ON THE WELL-COVEREDNESS OF SQUARE GRAPHS
| dc.authorid | Deniz, Zakir/0000-0002-0701-0397 | |
| dc.authorwosid | Deniz, Zakir/AAK-6689-2021 | |
| dc.contributor.author | Deniz, Zakir | |
| dc.date.accessioned | 2023-07-26T11:49:56Z | |
| dc.date.available | 2023-07-26T11:49:56Z | |
| dc.date.issued | 2022 | |
| dc.department | DÜ, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.description.abstract | The square of a graph G is obtained from G by putting an edge between two distinct vertices whenever their distance in G is 2. A graph is well-covered if every maximal independent set in the graph is of the same size. In this paper, we investigate the graphs whose squares are well-covered. We first provide a characterization of the trees whose squares are well-covered. Afterwards, we show that a bipartite graph G and its square are well-covered if and only if every component of G is K-1 or K-r,K-r for some r >= 1. Moreover, we obtain a characterization of the graphs whose squares are well-covered in the case alpha(G) = alpha(G(2)) + k for k is an element of {0, 1}. | en_US |
| dc.description.sponsorship | TUBITAK (The Scientific and Technological Research Council of Turkey) [121F018] | en_US |
| dc.description.sponsorship | This research was supported by TUBITAK (The Scientific and Technological Research Council of Turkey) under the project number 121F018. The author would like to thank anonymous referees for carefully reading and constructive comments that improved the presentation of this work. | en_US |
| dc.identifier.doi | 10.31801/cfsuasmas.910947 | |
| dc.identifier.endpage | 501 | en_US |
| dc.identifier.issn | 1303-5991 | |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.startpage | 490 | en_US |
| dc.identifier.trdizinid | 1118375 | en_US |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.910947 | |
| dc.identifier.uri | https://search.trdizin.gov.tr/yayin/detay/1118375 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12684/12169 | |
| dc.identifier.volume | 71 | en_US |
| dc.identifier.wos | WOS:000822397600006 | en_US |
| dc.identifier.wosquality | N/A | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | TR-Dizin | en_US |
| dc.institutionauthor | Deniz, Zakir | |
| dc.language.iso | en | en_US |
| dc.publisher | Ankara Univ, Fac Sci | en_US |
| dc.relation.ispartof | Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.snmz | $2023V1Guncelleme$ | en_US |
| dc.subject | Independent Set; Distance In Graphs; Well-Covered | en_US |
| dc.title | ON THE WELL-COVEREDNESS OF SQUARE GRAPHS | en_US |
| dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- 12169.pdf
- Boyut:
- 495.66 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin / Full Text
