http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2406 JAEM 2019, Vol 9, No 2 koleksiyonunu içerir. Thu, 09 Apr 2026 00:00:24 GMT 2026-04-09T00:00:24Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2729 Zagreb indices and multiplicative Zagreb indices of double graphs of subdivision graphs Togan, Müge; Yurttaş, Aysun; Çevik, Ahmet Sinan; Cangül, İsmail Naci Let G be a simple graph. The subdivision graph and the double graph are the graphs obtained from a given graph G which have several properties related to the properties of G. In this paper, the first and second Zagreb and multiplicative Zagreb indices of double graphs, subdivision graphs, double graphs of the subdivision graphs and subdivision graphs of the double graphs of G are obtained. In particular, these numbers are calculated for the frequently used null, path, cycle, star, complete, complete bipartite or tadpole graph. Tue, 01 Jan 2019 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2729 2019-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2728 Boundedly solvability of first order delay differential operators with piecewise constant arguments İpek Al, Pembe; Ismailov, Zameddin Using the methods of operator theory, we investigate all boundedly solvable extensions of a minimal operator generated by first order delay differential-operator expression with piecewise constant argument in the Hilbert space of vector-functions at finite interval. Also spectrum of these extensions is studied. Tue, 01 Jan 2019 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2728 2019-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2727 Harmonious coloring of multicopy of complete graphs Muntaner-Batle, Francesc Antoni; Vivin, Vernold J.; Venkatachalam, M. In this paper, we find the harmonious chromatic number of multicopy of complete graphs Kn. We generalize the result ?H ((n + 2)Kn) > n + 1 2 ! given in [8] and also further improve the result to ?H((n + 2)Kn) ? n + 1 2 ! + 3, ? n > 8. Tue, 01 Jan 2019 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2727 2019-01-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2726 An algorithmic approach to equitable edge chromatic number of graphs Vivik, Veninstine J.; Girija, G. The equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes differ by at most one. In this paper, we obtain the equitable edge chromatic number of S?, Wn, Hn and Gn. Tue, 01 Jan 2019 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2726 2019-01-01T00:00:00Z