Strong Domination Number of Some Graphs
| dc.contributor.author | Derya DOĞAN DURGUN | |
| dc.contributor.author | Berna LÖKÇÜ | |
| dc.date.accessioned | 2024-07-24T09:12:30Z | |
| dc.date.available | 2024-07-24T09:12:30Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | In this paper, we consider strong domination number of Pnk and Cnk . Let G=(V,E) be a graph, V is a vertex set and E is an edge set of graph G and u,v?V . u strongly dominates v and v weakly dominates u if (i) uv ? E and (ii) d ( u, G ) >= d ( v, G ) . A set D?V is a strong-dominating set (sd-set) of G if every vertex in VD is strongly dominated by at least one vertex in D. The strong domination number ?s of G is the minimum cardinality of an sd-set | |
| dc.identifier.issn | 1305-130X | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/24532 | |
| dc.language.iso | eng | |
| dc.title | Strong Domination Number of Some Graphs | |
| dc.type | Araştırma Makalesi |