JAEM 2019, Vol 9, No 2JAEM 2019, Vol 9, No 2 koleksiyonunu içerir.http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/24062026-04-09T00:01:02Z2026-04-09T00:01:02ZZagreb indices and multiplicative Zagreb indices of double graphs of subdivision graphsTogan, MügeYurttaş, AysunÇevik, Ahmet SinanCangül, İsmail Nacihttp://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/27292024-05-07T21:37:00Z2019-01-01T00:00:00ZZagreb 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.
2019-01-01T00:00:00ZBoundedly solvability of first order delay differential operators with piecewise constant argumentsİpek Al, PembeIsmailov, Zameddinhttp://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/27282024-05-07T21:37:01Z2019-01-01T00:00:00ZBoundedly 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.
2019-01-01T00:00:00ZHarmonious coloring of multicopy of complete graphsMuntaner-Batle, Francesc AntoniVivin, Vernold J.Venkatachalam, M.http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/27272024-05-07T21:37:00Z2019-01-01T00:00:00ZHarmonious 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.
2019-01-01T00:00:00ZAn algorithmic approach to equitable edge chromatic number of graphsVivik, Veninstine J.Girija, G.http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/27262024-05-07T21:36:48Z2019-01-01T00:00:00ZAn 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.
2019-01-01T00:00:00Z