JAEM 2021, Vol 11, Special Issue koleksiyonunu içerir. http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3013 2026-04-08T18:56:11Z 2026-04-08T18:56:11Z Rajpoot, Abhay Selvaganesh, Lavanya http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3043 2024-05-07T21:36:40Z 2021-01-01T00:00:00Z

Extension of m-polynomial and degree based topological indices for nanotube Rajpoot, Abhay; Selvaganesh, Lavanya The M-polynomial of a graph G(V (G), E(G)) is defined as M(G; u, v) = ? i?j miju?v?, where mij denotes the number of edges xy ? E(G) such that {dx, dy} = {i, j}, where dx, dy denote degree of the vertex x and y in the graph G(V (G), E(G)). In this paper, we show how to compute the degree-based indices such as Forgotten index, Reduced Second Zagreb index, Sigma index, Hyper-Zagreb index and Albertson index using the M-polynomial. In addition, we present as an application how to quickly and effectively compute the degree-based topological indices using M-polynomial for two carbon nanotube structures, namely HC?C?[p, q] and VC?C?[p, q].

2021-01-01T00:00:00Z Balaraman, Ganesan Kumar, Sanjay Sampath Sundareswaran, Raman http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3042 2024-05-07T21:36:41Z 2021-01-01T00:00:00Z

Geodetic domination integrity in graphs Balaraman, Ganesan; Kumar, Sanjay Sampath; Sundareswaran, Raman Reciprocal version of product degree distance of cactus graphs Let G be a simple graph. A subset S ? V (G) is a said to be a geodetic set if every vertex u /? S lies on a shortest path between two vertices from S. The minimum cardinality of such a set S is the geodetic number g(G) of G. A subset D ? V (G) is a dominating set of G if every vertex u /? D has at least one neighbor in D. The domination number ?(G) is the minimum cardinality of a dominating set of G. A subset is said to be a geodetic dominating set of G if it is both a geodetic and a dominating set. The geodetic domination number ?g(G) is the minimum cardinality among all geodetic dominating sets in G. The geodetic domination integrity of a graph G is defined by DIg(G) = min{|S| + m(G ? S) : S is a geodetic dominating set of G}, where m(G ? S) denotes the order of the largest component in G?S. In this paper, we study the concepts of geodetic dominating integrity of some families of graphs and derive some bounds for the geodetic domination integrity. Also we obtain geodetic domination integrity of some cartesian product of graphs.

2021-01-01T00:00:00Z Shanmugapriya, M. Sangeetha, P. http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3041 2024-05-07T21:36:40Z 2021-01-01T00:00:00Z

Neural network modeling of convection heat transfer coefficient for the casson nanofluid Shanmugapriya, M.; Sangeetha, P. This paper presents applications of Artificial Neural Network (ANN) to develop a mathematical model of magnetohydrodynamic (MHD) flow and heat transfer in a Casson nanofluid. The model equations are solved numerically by Runge-Kutta Fehlberg method with shooting technique. In the developing ANN model, the performance of the various configuration were compared with various types of errors such as Mean Square Error (MSE), Mean Absolute Error (MAE) and Sum Square Error (SSE). The best ANN configuration incorporated two hidden layers with twenty five neurons in each hidden layer was able to construct convective heat transfer coefficients with MSE, MAE and SSE of 0.006346, 0.009813 and 1.015423%, respectively, and had R² of 0.741516. A good co-relation has been obtained between the predicted results and the numerical values.

2021-01-01T00:00:00Z Malaravan, A. Chellaram Baskar, A. Wilson http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/3040 2024-05-07T21:36:42Z 2021-01-01T00:00:00Z

Both a graph and its complement are self-centered with identical radius Malaravan, A. Chellaram; Baskar, A. Wilson We show that a graph and its complement are self-centered with identical radius r only when r = 2. Further, we provide a construction of such a graph for any given order at least eight.

2021-01-01T00:00:00Z