Ara
Toplam kayıt 24, listelenen: 21-24
Chromatic weak domatic partition in graphs
(Işık University Press, 2019)
In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum ...
A digital scrambling method based on balancing numbers
(Işık University Press, 2019)
In this article, a new approach to the study of image scrambling based on balancing numbers, balancing transformation is presented. The properties of the proposed transformation and its periodicity are studied in details. ...
Divisor cordial labeling in the context of join and barycentric subdivision
(Işık University Press, 2019)
A divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V (G) to {1,2,...,|V(G)|} such that an edge e = uv is assigned the label 1 if f(u)|f(v) or f(v)|f(u) and the label 0 otherwise, then |e f ...
Ramsey numbers for class of edgeless, complete and star graphs
(Işık University Press, 2019)
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size ...