Güncel Gönderiler: Dergiler / Journals
Toplam kayıt 1171, listelenen: 681-700
-
Laguerre wavelet solution of Bratu and Duffing equations
(Işık University Press, 2021)The aim of this study is to solve the Bratu and Duffing equations by using the Laguerre wavelet method. The solution of these nonlinear equations is approximated by Laguerre wavelets which are defined by well known Laguerre ... -
Improvements on some inequalities of Hermite Hadamard inequalities for functions when a power of the absolute value of the second derivative h and P-convex
(Işık University Press, 2021)In this paper, firstly we obtain some improvements of Hermite-Hadamard integral inequalities via h and P-convex by using Hölder-İşcan inequality. Secondly new results are established. Thirdly, we determine some new ... -
Continuous K-g-fusion frames in Hilbert spaces
(Işık University Press, 2021)This paper aims at introducing the concept of c-K-g-fusion frames, which are generalizations of K-g-fusion frames, proving some new results on c-K-g-fusion frames in Hilbert spaces, defining duality of c-K-g-fusion frames ... -
Critical point approaches to second-order differential systems generated by impulses
(Işık University Press, 2021)Using variational methods and critical point theory, we establish multiplicity results of solutions for second-order differential systems generated by impulses. Indeed, employing two sorts of three critical points theorems, ... -
Some fractional estimates of upper bounds involving functions having exponential convexity property
(Işık University Press, 2021)The main objective of this article is to consider the class of exponentially convex functions. We derive a new integral identity involving Riemann-Liouville fractional integral. Utilizing this identity as an auxiliary ... -
Exact solution with dust and shell-crossings for LTB inhomogeneous cosmological models
(Işık University Press, 2021)We describe the solution of the Lemaitre-Tolman-Bondi (LTB) inhomogeneous cosmological models for a spherically symmetric with dust and an interaction term modeled as anisotropic pressure is also studied and a differential ... -
Generalization of non-commuting graph of a finite group
(Işık University Press, 2021)In this paper we define the generalized non-commuting graph ?(H,K,L) where H, K and L are three subgroups of a non-abelian group G. Take (H?K?L)\CH(K?L)?CK?L(H) as the vertices of the graph and two distinct vertices x and ... -
Extension of m-polynomial and degree based topological indices for nanotube
(Işık University Press, 2021)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 ... -
Geodetic domination integrity in graphs
(Işık University Press, 2021)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 ... -
Neural network modeling of convection heat transfer coefficient for the casson nanofluid
(Işık University Press, 2021)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 ... -
Both a graph and its complement are self-centered with identical radius
(Işık University Press, 2021)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. -
Vertex coloring edge weightings of some square graphs
(Işık University Press, 2021)A k-edge-weighting w of a graph G is an assignment of integer weight, w(e) ? {1, 2, . . . , k}, to each edge e. A k-edge-weighting w induces a vertex coloring c by defining c(u) = P u?e w(e) for every u ? V (G), where u ? ... -
Algorithmic complexity of isolate secure domination in graphs
(Işık University Press, 2021)A dominating set S is an Isolate Dominating Set (IDS) if the induced subgraph G[S] has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An ... -
Reciprocal version of product degree distance of cactus graphs
(Işık University Press, 2021)The reciprocal version of product degree distance is a product degree weighted version of Harary index defined for a connected graph G as RDD*(G) = Sigma({x, y}subset of V(G) )(d(G)(x).d(G)(y))/d(G)(x,y), where d(G)(x) is ... -
Bounds on hyper-status connectivity index of graphs
(Işık University Press, 2021)In this paper, we obtain the bounds for the hyper-status connectivity indices of a connected graph and its complement in terms of other graph invariants. In addition, the hyper-status connectivity indices of some composite ... -
Revan weighted PI index on some product of graphs
(Işık University Press, 2021)In chemical graph thoery, PI index is an additive topological index which has been used to measure the characteristics of chemical compounds. In this paper we introduce the weighted version of PI index of graph called the ... -
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
(Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Edge-vertex domination and total edge domination in trees
(Işık University Press, 2021)An edge e is an element of E(G) dominates a vertex v is an element of V (G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such ... -
I-Cordial labeling of spider graphs
(Işık University Press, 2021)Let G= (V, E) be a graph with p vertices and q edges. A graph G=(V,E)with p vertices and q edges is said to be an I-cordial labeling of a graph if there exists an injective map f from V to left perpendicular-p/2..p/2right ... -
A hybrid combination of substitution and transposition ciphers for efficient encryption using graph labeling
(Işık University Press, 2021)In this study, we conceptualise a hybrid approach of plaintext encryption by making use of Substitution and Transposition cipher technique namely Playfair Cipher and Simple Columnar Transposition. Both the Ciphers are ...
