On the well-coveredness of square graphs

dc.contributor.authorDeniz, Zakir
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2022-12-27T11:10:28Z
dc.date.available2022-12-27T11:10:28Z
dc.date.issued2022
dc.description.abstractThe 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 , r for some r ≥ 1 . Moreover, we obtain a characterization of the graphs whose squares are well-covered in the case α ( G ) = α ( G 2 ) + k for k ∈ { 0 , 1 } .tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage501tr_TR
dc.identifier.issn/e-issn1303-5991
dc.identifier.issue2tr_TR
dc.identifier.startpage490tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.910947tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/86495
dc.identifier.volume71tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.910947tr_TR
dc.relation.journalCommunications, Series A1:Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectIndependent set, distance in graphs, well-coveredtr_TR
dc.titleOn the well-coveredness of square graphstr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
10.31801-cfsuasmas.910947-1689600.pdf
Size:
495.66 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description: