Browsing by Author "Lokesha, Veerebradiah"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Publication Bounds for the sum of cubes of vertex degrees of splice graphs(Turkic World Mathematical, 2020-01-01) Lokesha, Veerebradiah; Jain, Sushmitha; Muddalapuram, Manjunath; Çevik, Ahmet Sinan; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; ABA-6206-2020; J-3505-2017Some chemically interesting graphs can be derived from simpler graphs by some graph operations. One of the most relevant among these interesting graphs is named as splice graphs. They are related to RNA sequencing and therefore is of great interest. The main target of this paper is to obtain the explicit interpretation of F-index in terms of the graph size and maximum or minimum vertex degrees of special splice graphs.Item Inverse problem for Zagreb indices(Springer, 2018-10-23) Lokesha, Veerebradiah; Gutman, Ivan; Yurttaş, Aysun; Togan, Müge; Cangül, İsmail Naci; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü.; 0000-0002-0700-5774; 0000-0002-0700-5774; ABA-6206-2020; J-3505-2017; AAG-8470-2021; 57204472437; 54403978300; 57189022403The inverse problem for integer-valued topological indices is about the existence of a graph having its index value equal to a given integer. We solve this problem for the first and second Zagreb indices, and present analogous results also for the forgotten and hyper-Zagreb index. The first Zagreb index of connected graphs can take any even positive integer value, except 4 and 8. The same is true if one restricts to trees or to molecular graphs. The second Zagreb index of connected graphs can take any positive integer value, except 2, 3, 5, 6, 7, 10, 11, 13, 15 and 17. The same is true if one restricts to trees or to molecular graphs.Publication VI. reciprocal status index and co-index of graphs(Hindawi, 2021-10-27) Lokesha, Veerebradiah; Suvarna; Çevik, Ahmet Sinan; Cangül, İsmail Naci; CANGÜL, İSMAİL NACİ; Bursa Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü; 0000-0002-0700-5774; J-3505-2017For the vertex set V (G) of a graph G, the sum of reciprocals of the breadth (distances) between the vertex v is an element of V (G) and whole other remaining vertices of G is called reciprocal status of v. In this study, first of all, we introduced the VL reciprocal status index and VL reciprocal status co-index of a graph G. Later, we exposed some sharp bounds for these indices. Furthermore, we determined the VL reciprocal status (co-)index over some standard graphs. Finally, we presented correlations between VL reciprocal status index and some properties of Butane derivatives via a table and illustrated with a figure.