Parity of an odd dominating set

dc.contributor.authorBatal, Mehmet
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2022-12-29T10:48:29Z
dc.date.available2022-12-29T10:48:29Z
dc.date.issued2022
dc.description.abstractFor a simple graph G with vertex set V ( G ) = { v 1 , . . . , v n } , we define the closed neighborhood set of a vertex u as \\ N [ u ] = { v ∈ V ( G ) | v is adjacent to u or v = u } and the closed neighborhood matrix N ( G ) as the matrix whose i th column is the characteristic vector of N [ v i ] . We say a set S is odd dominating if N [ u ] ∩ S is odd for all u ∈ V ( G ) . We prove that the parity of the cardinality of an odd dominating set of G is equal to the parity of the rank of G , where rank of G is defined as the dimension of the column space of N ( G ) . Using this result we prove several corollaries in one of which we obtain a general formula for the nullity of the join of graphs.tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage1028tr_TR
dc.identifier.issn/e-issn1303-5991
dc.identifier.issue4tr_TR
dc.identifier.startpage1023tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.1051208tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/86611
dc.identifier.volume71tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.1051208tr_TR
dc.relation.journalCommunications, Series A1:Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectLights out, all-ones problem, odd dominating set, parity domination, domination numbertr_TR
dc.titleParity of an odd dominating settr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
10.31801-cfsuasmas.1051208-2167172.pdf
Size:
443.46 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: