bluuebunny/crossref_metadata_2025 huggingface dataset:
Distance k-Cost Effective Sets in the Corona and Lexicographic Product of Graphs
Authors: Caadan Julius Guhiting , Paluga Rolando N. , Aniversario Imelda S.
Published: January 2023

Let G be a connected graph and k ≥ 1 be an integer. The open k-neighborhood Nk G(v) of v ∈ V (G) is the set Nk G(v) = {u ∈ V (G) \ {v}: dG(u, v) ≤ k}. A set S of vertices of G is called distance k-cost effective of G if for every vertex u in S, |Nk G(u) ∩ (V (G) \ S)| − |Nk G(u) ∩ S| ≥ 0. The maximum cardinality of a distance k-cost effective set of G is called the upper distance k-cost effective number of G. In this paper, we characterized the distance k-cost effective sets in the corona and lexicographic product of two graphs. Consequently, the bounds or the exact values of the upper distance k-cost effective numbers of these graphs are obtained.
On the Global Distance Roman Domination of Some Graphs
Authors: Entero Giovannie , Espinola Stephanie
Published: January 2023

Let k ∈ Z +. A k − distance Roman dominating function (kDRDF) on G = (V, E) is a function f : V → {0, 1, 2} such that for every vertex v with f(v) = 0, there is a vertex u with f(u) = 2 with d(u, v) ≤ k. The function f is a global k − distance Roman dominating function (GkDRDF) on G if and only if f is a k − distance Roman dominating function (kDRDF) on G and on its complement G. The weight of the global k − distance Roman dominating function (GkDRDF) f is the value w(f) = P x∈V f(x). The minimum weight of the global k − distance Roman dominating function (GkDRDF) on the graph G is called the global k − distance Roman domination number of G and is denoted as γ k gR(G). A γ k gR(G) − function is the global k − distance Roman dominating function on G with weight γ k gR(G). Note that, the global 1 − distance Roman domination number γ 1 gR(G) is the usual global Roman domination number γgR(G), that is, γ 1 gR(G) = γgR(G). The authors initiated this study. In this paper, the authors obtained and established the following results: preliminary results on global distance Roman domination; the global distance Roman domination on Kn, Kn, Pn, and Cn; and, some bounds and characterizations of global distance Roman domination over any graphs.
Path-Induced Closed Geodetic Domination of Some Common Graphs and Edge Corona of Graphs
Authors: Anoche Jesica , Aniversario Imelda , Merca Catherine I.
Published: January 2023

Let G be a connected graph of order n and S ⊆ V (G). A closed geodetic cover S of Gis a path-induced closed geodetic dominating set of a graph G if a subgraph  has a Hamiltonianpath and S is a dominating set of G. The minimum cardinality of a path-induced closed geodeticdominating set is called path-induced closed geodetic domination number of G. This study presentsthe characterization of the path-induced closed geodetic dominating sets of some common graphsand edge corona of two graphs. The path-induced closed geodetic domination numbers of thesegraphs are also determined.
On the study of Rainbow Antimagic Connection Number of Corona Product of Graphs
Authors: Septory Brian Juned , Susilowaty Liliek , Dafik  , Lokehsa V , Nagamani G
Published: January 2023

Given that a graph G = (V, E). By an edge-antimagic vertex labeling of graph, we mean assigning labels on each vertex under the label function f : V → {1, 2, . . . , |V (G)|} such that the associated weight of an edge uv ∈ E(G), namely w(xy) = f(x) + f(y), has distinct weight. A path P in the vertex-labeled graph G is said to be a rainbow path if for every two edges xy, x′y ′ ∈ E(P) satisfies w(xy) ̸= w(x ′y ′ ). The function f is called a rainbow antimagic labeling of G if for every two vertices x and y of G, there exists a rainbow x − y path. When we assign each edge xy with the color of the edge weight w(xy), thus we say the graph G admits a rainbow antimagic coloring. The rainbow antimagic connection number of G, denoted by rac(G), is the smallest number of colors induced from all edge weight of antimagic labeling. In this paper, we will study the rac(G) of the corona product of graphs. By the corona product of graphs G and H, denoted by G ⊙ H, we mean a graph obtained by taking a copy of graph G and n copies of graph H, namely H1, H2, ..., Hn, then connecting vertex vi from the copy of graph G to every vertex on graph Hi , i = 1, 2, 3, . . . , n. In this paper, we show the exact value of the rainbow antimagic connection number of Tn ⊙ Sm where Tn ∈ {Pn, Sn, Sn,p, Fn,3}.
Weak forms of (Λ, b)-open sets and weak (Λ, b)-continuity
Authors: Boonpok Chawalit , Srisarakham Napassanan
Published: January 2023

This paper is concerned with the concepts of s(Λ, b)-open sets, p(Λ, b)-open sets, α(Λ, b)-open sets, β(Λ, b)-open sets and b(Λ, b) open sets. Some properties of s(Λ, b)-open sets, p(Λ, b)-open sets, α(Λ, b)-open sets, β(Λ, b)-open sets and b(Λ, b)-open sets are investigated. Moreover, several characterizations of weakly (Λ, b)-continuous functions are established.
Weak α(Λ, sp)-continuity for multifunctions
Authors: Boonpok Chawalit , Thongmoon Montri
Published: January 2023

This paper deals with the concepts of upper and lower weakly α(Λ, sp)-continuous multifunctions. Moreover, several characterizations of upper and lower weakly α(Λ, sp)-continuous multifunctions are established.
Almost (Λ, sp)-continuity for Multifunctions
Authors: Boonpok Chawalit , Viriyapong Nongluk
Published: January 2023

This paper deals with the concepts of upper and lower almost (Λ, sp)-continuous multifunctions. Moreover, several characterizations of upper and lower almost (Λ, sp)-continuous multifunctions are investigated.
Strong Resolving Hop Domination in Graphs
Authors: Mohamad Jerson , Rara Helen
Published: January 2023

A vertex w in a connected graph G strongly resolves two distinct vertices u and v in V (G) if v is in any shortest u-w path or if u is in any shortest v-w path. A set W of vertices in G is a strong resolving set G if every two vertices of G are strongly resolved by some vertex of W. A set S subset of V (G) is a strong resolving hop dominating set of G if S is a strong resolving set in G and for every vertex v ∈ V (G) \ S there exists u ∈ S such that dG(u, v) = 2. The smallest cardinality of such a set S is called the strong resolving hop domination number of G. This paper presents the characterization of the strong resolving hop dominating sets in the join, corona and lexicographic product of graphs. Furthermore, this paper determines the exact value or bounds of their corresponding strong resolving hop domination number.
Upper and Lower Almost Contra-(Λ, sp)-continuity
Authors: Boonpok Chawalit , Khampakdee Jeeranunt
Published: January 2023

Our main purpose is to introduce the concepts of upper and lower almost contra- (Λ, sp)-continuous multifunctions. Moreover, several characterizations of upper and lower almost contra-(Λ, sp)-continuous multifunctions are investigated
On Some Forms of Closed Sets and Related Topics
Authors: Boonpok Chawalit , Viriyapong Chokchai
Published: January 2023

The purpose of the present article is to introduce the notion of (Λ, s)-closed sets. Especially, some properties of generalized (Λ, s)-closed sets are obtained. Several characterizations of some low separation axioms are given. Characterizations of (Λ, s)-extremally disconnected spaces are investigated. Furthermore, some characterizations of almost (Λ, s)-continuous functions are discussed.
Weakly Connected Hop Domination in Graphs Resulting from Some Binary Operations
Authors: Hamja Jamil , Aniversario Imelda S. , Merca Catherina I.
Published: January 2023

Let G = (V(G),E(G)) be a simple connected graph. A set S ⊆ V(G) is a weakly connected hop dominating set of G if for every q ∈ V \ S, there exists r ∈ S such that dG(q,r) = 2, the subgraph weakly induced by S, denoted by ⟨S⟩w = ⟨NG[S],Ew⟩ where Ew = {qr ∈ E(G) : q ∈ S or r∈S } is connected and S is a dominating set of G. The minimum cardinality of a weakly connected hop dominating set of G is called weakly connected hop domination number and is denoted by γwh(G). In this paper, the authors show and explore the concept of weakly connected hop dominating set. The weakly connected hop dominating set of some special graphs, shadow of graphs, join, corona and Lexicographic product of two graphs are characterized. Also, the weakly connected domination number of the aforementioned graphs are determined.

Keywords: weakly connected set, hop dominating set, hop domination number, weakly connected hop dominating set, and weakly connected hop domination number
On g-regularity and g-normality in Fuzzy Soft Topological Spaces
Authors: Saleh Salem , Al-Mufarrij Jawaher
Published: January 2023

The main aim of this work is to introduce and study the notions of generalized regularity, normality, and symmetric in fuzzy soft topological spaces via fuzzy soft generalized closed sets. Investigating some of their basic properties. Many related theorems and relations of these notions are presented. Moreover, the hereditary property and some preservation theorems are discussed.
Transversal Hop Domination in Graphs
Authors: Bonsocan Maria Andrea , Jamil Ferdinand
Published: January 2023

Let G be a graph. A set S ⊆ V (G) is a hop dominating set of G if for every v ∈ V (G)\S, there exists u ∈ S such that dG(u, v) = 2. The minimum cardinality γh(G) of a hop dominating set is the hop domination number of G. Any hop dominating set of G of cardinality γh(G) is a γh-set of G. A hop dominating set S of G which intersects every γh-set of G is a transversal hop dominating set. The minimum cardinality γbh(G) of a transversal hop dominating set in G is the transversal hop domination number of G. In this paper, we initiate the study of transversal hop domination. First, we characterize graphs G whose values for γbh(G) are either n or n − 1, and we determine the specific values of γbh(G) for some specific graphs. Next, we show that for every positive integers a and b with a ≥ 2 and b ≥ 3a, there exists a connected graph G on b vertices such that γbh(G) = a. We also show that for every positive integers a and b with 2 ≤ a ≤ b, there exists a connected graph G for which γh(G) = a and γbh(G) = b. Finally, we investigate the transversal hop dominating sets in the join and corona of two graphs, and determine their corresponding transversal hop domination numbers.
Inner Products on Discrete Morrey Spaces
Authors: Jakfar Muhammad , Manuharawati Manuharawati , Lukito Agung , Fiangga Shofan
Published: January 2023

The discrete Morrey space m_(u,p) is a generalization of the p-summable sequence space l^p. We have known that the space is a normed space, but the space m_(u,p) equipped with the usual norm is not an inner product space for p is not equal to 2. In this paper, we shall show that this space is actually contained in an inner product space. That means this space equipped with the inner product is an inner product space. The relationship between a standard norm on  and the inner product is studied.
Using Kriging Technique to Interpolate and Forecasting Temperatures Spatio-Temporal Data
Authors: Dhaher Ghanim , Shexo Ahmed
Published: January 2023

This paper deals with the forecasting temperatures’ spatio-temporal data. This research aims to examine the performance of two statistical methods for interpolating and predicting Spatio-temporal. The kriging technique and a dynamic semi-parameter factor model are applied in this work. The data adopted in this work represent the temperature in Mosul city and Baghdad city in Iraq. The results of our findings show the behavior prediction is closed to the fitting model based on the cross-validation through the comparison between the kriging method and dynamic semi-parametric factor model, we are getting that kriging prediction is more efficient with the second method of the dynamic model. In conclusion, the results show that prediction is consistent with geographic basis risk, also the performance of the dynamic semi-parameter factor model appears to the extent of geographic basis risk to describe the information of the prediction model.
Investigating the Association Between Carbon Dioxide (CO2) Emissions and Energy Consumption on the Economic Growth of Clusterized Countries in the World
Authors: Wardhani Laksmi Prita , Rukmi Alvida Mustika , Ardamayanti Thaliah Fauz
Published: January 2023

This research aims to investigate the relationship between carbon dioxide (CO2) emissions and energy consumption on the economic growth of countries in the world based on Gross Domestic Product (GDP). We use a large volume of data related to CO2 emissions per capita and energy consumption per capita of each country in the world, so a clustering process is needed using the K-Means method, which divides the country into three cluster labels: high, medium, and low. Then, we performed multiple linear regression using the Generalized Least Square with Autoregressive (GLSAR) method for data that did not satisfy the Best Linear Unbiased Estimator (BLUE) criteria. The results are that countries included in the high cluster have a closer relationship between CO2 emissions and energy consumption to GDP than the medium cluster. Likewise, for the medium cluster against the low cluster.
On Interval Valued Fuzzy Bi-interior Ideals in Semigroups
Authors: Gaketem Thiti , Prommai Tanaphong
Published: January 2023

In this paper, we study the concept of an interval valued fuzzy bi-interior ideal. We investigate the properties of an interval valued fuzzy bi-interior ideal in semigroups. We characterize a regular semigroup in terms of an interval valued fuzzy bi-interior ideal.
Multipolar Fuzzy KU-ideals in KU-algebras
Authors: Alshehri Halimah Abdulrahman
Published: January 2023

This article presents the idea of an m-polar fuzzy KU-ideal and investigates its characteristics. The relationship between an m-polar fuzzy KU-subalgebra and an m-polar fuzzy KU-ideal is presented in the discussion
A New Scalar of Conjugate Gradient Methods for Solving Unconstrained Minimization
Authors: Mohammad T. Saja O. , Saeed  Chilmeran Hamsa Th. , Al-Kawaz Rana Z.
Published: January 2023

In this paper, we derive a search direction for the conjugate-gradient method based on use of self-scaling Quasi Newton-method, and the usefulness of the new method is to solve unconstrained optimization problems with large dimensions. In order to clarify the importance of the proposed method, we have shown its characteristics in terms of the sufficient descent condition and the theoretically global convergence condition. Numerically, we applied the proposed method to a variety of known test functions to prove its effectiveness. When compared with some previous methods of the same direction, the proposed method proved to be superior to them in relation to the tools used for this purpose.
More on Ideal Rothberger Spaces
Authors: Guldurdek Asli
Published: January 2023

The aim of this note is to provide an answer to a question posted in a recent paper. In2018, after introducing the notion of Ideal Rothberger space, author examines some properties ofthese spaces. Also there has been a comparison of the spaces (X, τ ), and (X, τ∗) in terms of being(ideal)Rothberger. According to this, it is shown that if (X, τ∗) is a Rothberger space, then (X, τ )is also Rothberger. Therefore, naturally it is asked that, if one can find some extra conditionsfor ideal I, then the opposite also holds. Thus, for which ideal I, an I-Rothberger space (X, τ )implies an I-Rothberger space (X, τ∗)? In this work it has been proved that I is a σ-ideal, and τis compatible with I, which provides the solution.
Graph Automata and Graph Colorability
Authors: Kalampakas Antonios
Published: January 2023

Automata recognizing graphs can be constructed by employing the algebraic structure of graphoids. For the construction of a graph automaton, the relations over the Kleene star of the state set must constitute a graphoid. Hence different kinds of graphoids produce graph automata with diverse operation and recognition capacity. In this paper we show that graph colorability is recognized by automata operating over the simplest possible abelian graphoid.
Single-valued Neutrosophic Soft Sets in Hyper UP-Algebra
Authors: Cano Allan , Petalcorin Gaudencio
Published: January 2023

In this paper, the notions of SVN hyper UP-algebra and SVNS hyper UP-algebra are introduced, and some of their structural properties are investigated. Moreover, the Cartesian product of SVNS hyper UP-algebra is discussed and proved to be a SVNS hyper UP- algebra. Finally, the homomorphic image and preimage of SVNS hyper UP-algebra under SVNS functions are studied and showed also to be SVNS hyper UP-algebra.
Grey Wolves Attack Process for the Pareto Optimal Front Construction in the Multiobjective Optimization
Authors: Bamogo Wendinda , Some Kounhinir , Poda Joseph
Published: January 2023

We propose a new metaheuristic, HmGWOGA-MO, for solving multiobjective optimization problems operating with a population of solutions. The method is a hybridization of the HmGWOGA method, which is a single objective optimization method, and the ϵ-constraint approach, which is an aggregation technique. The ϵ-constraint technique is one of the best ways to transform a problem with many objective functions into a single objective problem because it works even if the problem has any kind of Pareto optimal front. Previously, the HmGWOGA method was designed to optimize a positive single-objective function without constraints. The obtained solutions are good. That is why, in this current work, we combined have it with the ϵ-constraint approach for the resolution of multiobjective optimization problems. Our new method proceeds by transforming a given multiobjective optimization problem with constraints into an unconstrained optimization of a single objective function. With the HmGWOGA method, five different test problems with varying Pareto fronts have been successfully solved, and the results are compared with those of NSGA-II regarding convergence towards the Pareto front and the distribution of solutions on the Pareto front. This numerical study indicates that HmGWOGA-MO is the best choice for solving a multiobjective optimization problem when convergence is the most important performance parameter.
Moment Generating Function of Current Records Based on Generalized Exponential Distribution with Some Recurrence Relations
Authors: Aldallal Ramy
Published: January 2023

This paper tries to find some formulas for calculating the moment generating function for upper and lower current records picked from generalized exponential distributed data and the joint moment generating function between them. After that, some formulas are derived from the previous ones to find the moments of each and the product moments of both upper and lower current records. Then, various recurrence relations are established for most of the mentioned formulas. After that, an integral form of the moments of record range is founded followed by a numerical example with simulated data to clarify the effectiveness of the formulas found in the study and how they can make the calculation process easier and faster. Finally, a conclusion part is added, to sum up what has been done and the results.
Resolving Domination in Graphs under Some Binary Operations
Authors: Monsanto Gerald Bacon , Rara Helan
Published: January 2023

In this paper, we investigate the concept of resolving dominating set in a graph. In particular, we characterize the resolving dominating sets in the join, corona and lexicographic product of two graphs and determine the resolving domination number of these graphs.
Stable Locating-Dominating Sets in the Edge Corona and Lexicographic Product of Graphs
Authors: Malacas Gina A. , Canoy, Jr. Sergio , Chacon Emmy
Published: January 2023

A set S ⊆ V (G) of an undirected graph G is a locating-dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such tha vw ∈ E(G) and NG(x) ∩ S ̸= NG(y) ∩ S for any two distinct vertices x and y in V (G) \ S. S is a stable locating-dominating set of G if it is a locating-dominating set of G and S \ {v} is a locating-dominating set of G for each v ∈ S. The minimum cardinality of a stable locating-dominating set of G, denoted by γSLD(G), is called the stable locating-domination number of G. In this paper, we investigate this concept and the corresponding parameter for edge corona and lexicographic product of graphs.
Geodetic Hop Dominating Sets in a Graph
Authors: Saromines Chrisley Jade , Canoy, Jr. Sergio
Published: January 2023

Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A subset S of vertices of G is a geodetic hop dominating set if it is both a geodetic and a hop dominating set. The geodetic hop domination number of G, γhg(G), is the minimum cardinality among all geodetic hop dominating sets in G. Geodetic hop dominating sets in a graph resulting from some binary operations have been characterized. These characterizations have been used to determine some tight bounds for the geodetic hop domination number of each of the graphs considered.
Mathematical Eigenfunctions Analysis for 2nd Kind of Fredholm Integral equations
Authors: Al-Taee Lamiaa Hazim , Fawze Ahmed A. Mohammed
Published: January 2023

The current paper is a trial to investigate the Eigen functions appears through mathematical treatment of 2nd kind of Fredholm integral equations by making use a new developed an Inverse Iterative Numerical Scheme (IINS). To test the applicability and accuracy of the proposed IINS, two numerical examples were solved and compared with previous results. The discussion of the results gave a good coincides up to some decimal places of results with the available ones.
Cliques and Supercliques in Graphs
Authors: Canoy , Jr. Sergio , Dela Cerna Ramil , Abragan Armalene
Published: January 2023

A set S ⊆ V (G) of an undirected graph G is a clique if every two distinct vertices in S are adjacent. A clique is a superclique if for every pair of distinct vertices v, w ∈ S, there exists u ∈ V (G) \ S such that u ∈ NG(v) \ NG(w) or u ∈ NG(w) \ NG(v). The maximum cardinality of a clique (resp. superclique) in G is called the clique (resp. superclique) number of G. In this paper, we determine the clique and superclique numbers of some graphs.
Strong Resolving Domination in the Lexicographic Product of Graphs
Authors: Monsanto Gerald Bacon , Acal Penelyn L. , Rara Helen M.
Published: January 2023

Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G. In this paper, we characterize the strong resolving dominating sets in the lexicographic product of graphs and determine the corresponding resolving domination number.
Graphs and the Prime Spectrum of Unitary Commutative Rings
Authors: Alharbi Badr
Published: January 2023

In this paper, we study the relationships between graphs and the prime spectrum of unitary commutative rings. It is shown that a graph G equipped with the G-right topology satisfies some spectral properties. In particular we give a necessarily and sufficient condition to obtain a spectral graph.
Submaximality on Bigeneralized Topological Spaces
Authors: Farhat Yasser , Krishnan Muthumari , Subramanian Vadakasi , M. R. Ahmadi Zand
Published: January 2023

In this article, in a bigeneralized topological space, we introduce a new space namely, (s, v)-bigeneralized submaximal space, and analyze its nature. Also, the characterization theorem for a (s, v)-bigeneralized submaximal space, image and preimage of (s, v) bigeneralized submaximal is a (s, v)-bigeneralized submaximal space under (µ, η)-open, (µ, η)-continuous map, respectively are proved. Further, the relationship between hyperconnected space and submaximal space in a pairwise bigeneralized submaximal space is given.
Convex Hop Domination in Graphs
Authors: Hassan Javier , Canoy, Jr. Sergio , Saromines Chrisley Jade
Published: January 2023

Let G be an undirected connected graph with vertex and edge sets V (G) and E(G), respectively. A set C ⊆ V (G) is called convex hop dominating if for every two vertices x, y ∈ C, the vertex set of every x-y geodesic is contained in C and for every v ∈ V (G) \ C, there exists w ∈ C such that dG(v, w) = 2. The minimum cardinality of convex hop dominating set of G, denoted by γconh(G), is called the convex hop domination number of G. In this paper, we show that every two positive integers a and b, where 2 ≤ a ≤ b, are realizable as the connected hop domination number and convex hop domination number, respectively, of a connected graph. We also characterize the convex hop dominating sets in some graphs and determine their convex hop domination numbers.
Second Order Expansions for Extreme Quantiles of Burr Distributions and Asymptotic Theory of Record Values
Authors: Diallo Moumouni , Ngom Modou , Dembele Soumaila , Lo Gane  Samb
Published: January 2023

In this paper we investigate the Burr distributions family which contains twelve members. Second order expansions of quantiles of the Burr’s distributions are provided on which may be based statistical methods, in particular in extreme value theory. Beyond the proper interest of these expansions, we apply them to characterize the asymptotic laws of their records of Burr’s distributions, lead to new statistical tests.
Restrained 2-Resolving Hop Domination in Graphs
Authors: Mahistrado Angelica Mae , Rara Helen
Published: January 2023

Let G be a connected graph. A set S ⊆ V (G) is a restrained 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set of G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2-resolving hop domination number of G, denoted by γr2Rh(G) is the smallest cardinality of a restrained 2-resolving hop dominating set of G. This study aims to combine the concept of hop domination with the restrained 2-resolving sets of graphs. The main results generated in this study include the characterization of restrained 2-resolving hop dominating sets in the join, corona, edge corona and lexicographic product of graphs, as well as their corresponding bounds or exact values.
Optimal Control of COVID-19 Model with Partial Comorbid Subpopulations and Two Isolation Treatments in Indonesia
Authors: Rois Muhammad Abdurrahman , Fatmawati  , Alfiniyah Cicik
Published: January 2023

We applied sensitivity analysis and optimum control to the COVID-19 model in this research. In addition, the basic reproduction number calculated as 1.57 indicates that this illness is widespread across Indonesia. The most important factor in this model is the contact rate with infected people, with or without comorbidity. Optimal control will minimize the number of infected populations without and with comorbidity, and costs. Numerical experiments will be carried out to describe and compare the graphical models of the spread of COVID-19 with and without controls. From the numerical results and cost-effectiveness analysis on the optimal control problem, it is found that applying a combination of controls can give the best results compared to a single control
1-Movable Resolving Hop Domination in Graphs
Authors: Mohamad Jerson , Rara Helen
Published: January 2023

Let G be a connected graph. A set W ⊆ V (G) is a resolving hop dominating set of G if W is a resolving set in G and for every vertex v ∈ V (G) \ W there exists u ∈ W such that dG(u, v) = 2. A set S ⊆ V (G) is a 1-movable resolving hop dominating set of G if S is a resolving hop dominating set of G and for every v ∈ S, either S \ {v} is a resolving hop dominating set of G or there exists a vertex u ∈ ((V (G) \ S) ∩ NG(v)) such that (S \ {v}) ∪ {u} is a resolving hop dominating set of G. The 1-movable resolving hop domination number of G, denoted by γ 1 mRh(G) is the smallest cardinality of a 1-movable resolving hop dominating set of G. This paper presents the characterization of the 1-movable resolving hop dominating sets in the join, corona and lexicographic product of graphs. Furthermore, this paper determines the exact value or bounds of their corresponding 1-movable resolving hop domination number.
Isogeometric Analysis Approximation of Linear Elliptic Equations with L1 Data
Authors: Bassonon Yibour Corentin , Ouedraogo Arouna
Published: January 2023

Isogeometric Analysis (IgA) is a recent technique for the discretization of Partial Differential Equations (PDEs). The main feature of the method is the ability to maintain the same exact description of the computational domain geometry throughout the analysis process, including refinement. In the present paper, we consider, in dimension d >= 2 the Isogeometric Analysis approximation of second order elliptic equations in divergence form with right-hand side in L1   . We assume that the family of meshes is shape regular and satisfies the discrete maximum principle. When the right-hand side belongs to L1(\Omega), we prove that the unique solution of the discrete problem converges to the unique renormalized solution in W01,q(\Omega),  1 <= q < d/(d-1) . We also prove some error estimates and include numerical tests for data with low smoothness.
First and Third Isomorphism Theorems for the Dual B-Algebra
Authors: Bolima Jethro Elijah , Belleza Fuentes Katrina
Published: January 2023

In this paper, some properties of the dual B-homomorphism are provided, along with the natural dual B-homomorphism and the fundamental theorem of dual B-homomorphisms for dual B-algebras. The first and third isomorphism theorems for the dual B algebra are also presented in the paper.
An Iterative Approach for Numerical Solution to the Time-fractional Richards Equation with Implicit Neumann Boundary Conditions
Authors: Zeki Mustafa , Tatar Salih
Published: January 2023

In this paper, we develop an iterative method of lines scheme for the numerical solution to the time fractional Richards equation with implicit Neumann boundary conditions, which is an effective tool for describing a process of flow through unsaturated media. A numerical example is provided to show the effectiveness of the presented method for different model parameters and inputs. The method illustrated here can be applied to other types Richards equation with various input functions and Dirichlet boundary conditions.
Hermite Hadamard Type Inequalities Involving (k-p) Fractional Operator with (α, h − m) − p convexity
Authors: Stojiljkovic Vuk
Published: January 2023

We establish various fractional convex inequalities of the Hermite-Hadamard type which generalize the previously obtained results in the literature. Various types of such inequalities are obtained and given as corollaries. The main motivation of the paper is to generalize the recently published results in terms of the (α, h − m) − p convexity with k-p Riemann Liouville fractional operator. The application of H¨olders inequality is given in tandem with the k-p fractional operator of the convex type.
Fabricación y caracterización de pozos cuánticos para el estudio de la interacción luz-materia
Authors: Tapia-Rodríguez Lucy Estefanía , Guevara-Macías Liliana Estela , Lastras-Martínez Alfonso , Lastras-Martínez Luis Felipe
Published: February 2023

Los pozos cuánticos representan la base de una gran variedad de dispositivos electrónicos, entre ellos los ledes, láseres, fotodetectores y moduladores. Las propiedades optoelectrónicas de estos sistemas dependen de su composición química y del espesor de las capas crecidas. Por dicha razón, es necesario tener un control preciso durante su crecimiento. El presente trabajo tuvo como objetivo inducir el crecimiento epitaxial de pozos cuánticos intrínsecos (sin ningún dopaje) asimétricos acoplados y desacoplados de AlGaAs/GaAs/AlGaAs, así como, establecer su caracterización mediante técnicas de espectroscopía óptica, como lo son la reflectancia diferencial, también conocida como espectroscopía de reflectancia anisotrópica (RAS) y la fotoluminiscencia (PL). Se realizó un estudio experimental de las interacciones entre niveles de energía en los pozos cuánticos asimétricos acoplados. Este tipo de estructuras son especialmente interesantes por permitir la formación y observación, no solo de excitones directos, dentro del mismo pozo, sino también, de excitones y triones indirectos, que se forman entre electrones de un pozo y huecos de otro pozo vecino (Transiciones intra-QW). Se hicieron crecer tres pozos intrínsecos, basados en arseniuro de galio (GaAs): un pozo individual (desacoplado) y un par de pozos asimétricos acoplados, a través de epitaxia por haces moleculares (MBE). Se observó el efecto del rompimiento de simetría (de D2d a C2v) en las propiedades espintrónicas de la estructura, a través de PL y RAS, a una temperatura de ~ 30 K. Se lograron establecer las técnicas y métodos necesarios para el crecimiento de pozos cuánticos intrínsecos, que constituyen la base para la creación de dispositivos y estructuras más complejas. El uso de técnicas espectroscópicas permitió demostrar la presencia de anisotropías ópticas, que repercuten en el comportamiento del espín de los excitones en pozos cuánticos.
Impact of Demographic Factors on Emotional Intelligence in Selected Organization in the Kathmandu Valley
Authors: THAPA Pramila , AKASHE Shyam , BHATTARAİ Hemlal
Published: January 2023

This study's main goal is to investigate how socio-demographic factors affect employees' Emotional Intelligence (EI), particularly in Kathmandu valley organizations. Cross-sectional, the quantitative study design was used; convenience sampling techniques and the sample size were calculated using Cochran's formula. However, the instruments tested content validity, factor analysis, reliability, and a pilot test. There were 35 EI questions, and socio-demographic features (gender, age, work experience, qualification, marital status, and EI training). Descriptive, Regression, and ANOVA test were utilized to accomplish the goal. The findings reveled that there was a significant relationship between EI with work experiences, EI training, marital status, and social media engagement. In this regards, researchers suggested that; EI is a skill that can be acquired, researchers suggest that; organizations should create a culture where emotional intelligence can be fostered. Factors such as social media engagement, work experiences, and EI training, play a role in an employee's success.
Note-producing and Note-reading Patterns of Turkish Students in Consecutive Interpreting
Authors: KHEZERLOU Ebrahim
Published: January 2023

Consecutive interpreting (CI) is a mode of verbal translation between a source and target language (TL) which “involves listening to what someone has to say and then, when they have finished speaking, reproducing the same message in another language (Gillies, 2017, P. 5). Note-taking, a fundamental skill in the process of long CI, refers to the activity of jotting down a speech in a highly individualised style and then recreating the original speech by the help of a combination of notes, memory, and general knowledge (Albl-Mikasa, 2008; Gillies 2017). To better understand the expertise in the context of Turkey, the study examined the idea-identifying, note-producing, and note-reading patterns of 26 undergraduate Turkish students majoring in English Language Translation and Interpreting. The data for the study were obtained from three official exams. The results revealed a preference for the use of word note form over the other ones among the students. They also confirmed a better idea-identifying, note-producing, and note-reading performances among the high-level students. Moreover, it was found that note-reading patterns of the students were better than their note-producing ones. The findings of study are pedagogically useful for teachers in their classes and practically helpful for practitioners in the field.
Magnezyum ve Magnezyum Esaslı Malzemelerde Korozyon
Authors: KELEN Fevzi
Published: January 2023

Düşük yoğunluk, yüksek spesifik mukavemet, kolay geri kazanım ve mükemmel sönümleme kapasitesi gibi karakteristikleri ile modern hafif araçlar için en dikkat çekici yapısal malzemeler olarak ön plana çıkan magnezyum ve magnezyum esaslı malzemeler otomotiv ve havacılık gibi ulaşım dalları için önemli bir potansiyel oluşturmaktadır. Yakıt verimliliğinin arttırılması ve karbondioksit salınımının en aza indirgenmesinin amaçlandığı bu alanlarda direksiyon simidi, gösterge paneli, torpido kapağı ve karter gibi birçok uygulamaları bulunmaktadır. Bilhassa otomotiv endüstrisinde tüketim hacimleri her geçen gün artmaktadır. Fakat düşük korozyon dayanımları kullanımlarını gerek otomotiv sektöründe gerekse de endüstride demir, çelik ve alüminyuma kıyasla önemli oranda kısıtlamaktadır. Bu bağlamda yüksek korozyon dayanımlı magnezyum esaslı malzemelerin geliştirilmesi başlıca beklenti haline gelmiştir. Bu çalışmada yakıt tasarrufu ve düşük emisyon bakımından en umut verici yapısal malzemeler olan magnezyum ve magnezyum esaslı malzemelerin korozyon özelliklerine ve korozyon dayanımlarının nasıl iyileştirilebileceğine dikkat çekilmek istenmiştir.
Kastamonu ve Düzce İllerinde Yeni Bir Zararlı Phloeomyzus passerinii (Signoret, 1875) (Hemiptera: Aphididae)
Authors: YÜKSEL Beşir , ÖZTÜRK Nuray
Published: January 2023

Kavak pamuklu kabukbiti, Phloeomyzus passerinii (Signoret) (Hemiptera: Aphididae), kavak plantasyonlarının önemli monofag kültür zararlılarından biridir. P. passerinii Avrasya kökenli bir tür olup Türkiye’de Orta Anadolu’da kavaklarda oldukça önemli zararlar yaptığı bilinmektedir. Düzce - Çilimli ve Kastamonu’nun ilçelerinde 2021 yılı Mayıs - Ağustos aylarında kavak ağaçlandırma sahalarında sörveyler yapılmıştır. Arazide yapılan incelemeler neticesinde kavakların gövde ve dallarındaki çatlaklarda beyaz bir pamuk tabakası içerisinde bulunan zararlı örnekleri laboratuvara getirilmiş ve teşhis işlemleri gerçekleştirilmiştir. Kabukbitinin neden olduğu zarara ilişkin kavak örneklerinin görüntüleri ve zarar şekli literatürdeki bilgilerle değerlendirilmiştir. Bu afit kolonileri, esas olarak aptera partenogenetik dişileri tarafından üretilen çok sayıda bireyleri ve mumsu salgılarıyla varlığını göstermiştir. Bu çalışma ile P. passerinii Kastamonu ve Düzce illerinden ilk defa rapor edilmiştir. Karadeniz bölgesinde kavak ağaçlandırma sahaları ve özellikle I-214 klonu için önemli bir zararlı olma potansiyeli bulunmaktadır.
Effect of Chopped Carbon Fibers Amount on the Mechanical and Tribological Properties of Polyester Matrix Composite
Authors: AKGÜL Yasin , YALÇIN Metin Efe , ETİCHA Andinet Kumella
Published: January 2023

In this study, the effect of the amount of short carbon fibers (SCFs) on the mechanical and tribological properties of polyester (PES) composite were investigated. Composites were produced with different weight fractions (0.5%, 1%, and 2%) of SCFs by the hand lay-up method. The flexural strength and flexural modulus of samples was studied by conducting 3-point bending tests, whereas the energy-absorbing performance was examined by performing the Izod impact test. Moreover, the wear resistance properties of samples were measured by applying a 20 N load. The scanning electron microscope was used to examine the morphology of broken and worn surfaces of specimens. Test results exhibit the flexural strength and flexural modulus of SCFs reinforced polyester composite was decreased with the increment of fiber contents. However, the same trend was not observed for the impact test. Thus, the addition of 2 wt. % SCFs onto pure polyester improves the energy absorbing of pure polyester nearly by 210%. The present study also reveals the wear resistance properties of SCFs reinforced polyester composites are indirectly related with of SCFs content. Hence, the highest wear resistance capacity was observed for PES0.5CF of about 1.51×10-3 mm3/m. Therefore, the addition of small amounts of SCFs onto pure polyester attributes significant effects in tribological behaviors compared to mechanical properties.
Konsol Palplanş Duvarların Tasarımını Etkileyen Faktörlerin Araştırılması ve Pratik Abakların Geliştirilmesi
Authors: YAZICI Mehmet Fatih , KESKİN Nilay
Published: January 2023

Şevli kazının yapılamadığı derin temel kazılarında iksa sistemi kullanılması, 2018 tarihli “Kazı Güvenliği ve Alınacak Önlemler” genelgesinde zorunlu kılınmıştır. Ayrıca genelgede, 2 yıldan daha az bir süre için bir kazı desteğine ihtiyaç duyulması durumunda iksa sisteminin geçici olarak kullanılabileceği belirtilmiştir. 6 m’den daha düşük kazı derinliklerinin geçici olarak desteklenmesi amacı ile konsol palplanşlar sıkça kullanılmaktadır. Bu çalışmada, geoteknik tasarımcılara kolaylık sağlaması amacıyla içsel sürtünme açısı 24-40° arasında değişen granüler bir zemin içerisinde açılacak 3-6,2 m derinliğinde bir kazı için geçici bir desteğe ihtiyaç duyulması durumunda kullanılacak konsol çelik palplanş duvarların tasarımı ile ilgili grafik ve tablolar oluşturulmuştur. Yer altı su seviyesinin varlığına, konumuna ve zeminin içsel sürtünme açısına bağlı olarak toplamda 14739 farklı kesit incelenmiş ve çakma derinliği, maksimum eğilme momenti ve maliyetler ile ilgili oluşturulan tablo ve grafikler tasarımcıların kullanımına sunulmuştur. Bu tablo ve grafiklerin yardımı ile tasarım süresinin kısaltılması ve maliyet ile ilgili hızlı değerlendirme yapılabilmesi amaçlanmıştır. Ayrıca deplasman analizi yapan paket programların veri girişi aşamasında tasarımcıların duvar boyu için deneme-yanılma sürecine girmeden bu tablo ve grafiklerde verilen bilgileri kullanarak kısa sürede analizlerini gerçekleştirmeleri hedeflenmiştir.
Konfor Kanallarının Amortisör Performansına Etkisinin Deneysel Olarak İncelenmesi
Authors: KAMIŞ KOCABIÇAK Zeliha , ANAÇ Harun
Published: January 2023

Yol zemininin düzgünlüğü, viraj dönme, hızlanma, frenleme, maksimum yük taşıma kapasitesi gibi parametrelere bağlı olarak amortisör beklentileri değişir. Bu gibi farklı durumlarda beklentileri karşılamak için amortisör sönümleme kuvvetinin değişken olması gerekir. Ancak pasif amortisörlerde sönümleme kuvveti yol durumundan bağımsız olarak piston ve taban valflerindeki yağ geçişlerine göre belirli hızlar için sabittir. Valf gruplarındaki akışa ek olarak, genellikle hafif ticari araçlar için silindire açılan konfor kanalları yardımı ile amortisörün sertleşmesi veya yumuşaması şeklinde karakteristikleri değiştirilebilmektedir. Bu çalışmada konfor kanalına sahip olmayan ve olan aynı valf gruplarına sahip çift borulu teleskobik amortisörler test edilerek konfor kanallarının amortisör performansı üzerindeki etkisi araştırılmıştır. Konfor kanallarının özellikle düşük hızlarda sönümleme kuvvetini düşürdüğü ve konforlu sürüş sağladığı tespit edilmiştir.
Bölgesel Tabanlı Evrişimli Sinir Ağı ile Araç Plaka Tanıma
Authors: ÇAY Talip , ÖLMEZ Emre , ER Orhan
Published: January 2023

Bu çalışmada, Bölgesel Tabanlı Evrişimli Sinir Ağları (R-CNN) ile araç plaka lokasyonu belirleme ve belirlenen lokasyon içerisinden plaka okuma işlemi gerçekleştirilmiştir. İki aşamadan oluşan çalışmanın ilk aşamasında giriş görüntüleri üzerinden plaka lokasyonları R-CNN ile belirlenirken ikinci aşamada geleneksel görüntü işleme teknikleri ile belirlenen lokasyonlardan plaka okuma işlemi gerçekleştirilmektedir. Çalışmada tasarlanan R-CNN eğitiminde veri setinde bulunan 550 adet görüntüden 450 adedi eğitimde ve 100 adedi test işleminde kullanılmıştır. R-CNN ile plaka lokasyonu bulma işleminde test seti üzerinde %95 başarı oranına ulaşılırken doğru olarak belirlenen lokasyonlardan plaka okuma işleminde %97 başarı oranına ulaşılmıştır.
İzmir İli, Çiğli İlçesinin Mevcut ve İmar Uygulama Planındaki Açık Yeşil Alan Yeterliliğinin İrdelenmesi
Authors: YÜKSEK İzzet , ESEN Yeşim
Published: January 2023

Ülkemizde, özellikle büyükşehirlerde sanayileşmeye paralel olarak, kırsal alandan kentlere göçle beraber kentsel nüfus hızla artmıştır ve artmaya devam etmektedir. Nüfus artışı beraberinde düzensiz kentleşmeyi de getirmiştir. Plansız kentleşme, kentlilerin ihtiyacı olan asgari şartların sağlamasını olumsuz etkilemektedir. Bu ihtiyaçlardan biri de açık – yeşil alanlardır. Açık-yeşil alanlar; halkın yaşam kalitesini olumlu yönde etkileyen ve kentleri pek çok açıdan daha yaşanabilir kılan, halkın sosyalleşme, spor ve temiz hava gibi ihtiyaçlarını karşılayabildikleri yerlerdir. Bu alanların yetersiz olması kent sakinlerinin yeşil alan ihtiyaçlarını kendilerine daha uzak, kırsal alanlardan karşılamasına neden olabilmektedir. Bu çalışmada İzmir ili, Çiğli ilçesi örneğinde 1/1000 ölçekli uygulama imar planı üzerinden, açık-yeşil alanların yeterliliği analiz edilecektir. Bu bağlamda, toplam açık yeşil alan miktarı ve kişi başına düşen miktar ve oranları, yeşil alan parsel büyüklükleri mevcut açık-yeşil alan verileriyle karşılaştırılarak incelenmiştir. Çalışmanın sonucunda; ilçede kişi başına düşen açık-yeşil alan miktarı belirlenmiş, açık-yeşil alanların nitelik değerlerinin uluslararası standartlar çerçevesinde yetersiz olduğu tespit edilmiş ve çözüm önerileri geliştirilmiştir.
Some Results on Important Inequalities for Univalent Functions with Positive and Negative Coefficients
Authors: AKYAR Alaattin
Published: January 2023

As it is known from Real Analysis, inequalities are used to give the definition of many mathematical concepts formally and to analyze them analytically. Similarly, the geometric characterizations of the range of analytic and univalent functions in the open unit disc U = {z ∈ C : |z| < 1} can be easily analyzed with inequalities and easily classified these functions.
Peyzaj Yapısındaki Zamansal/Mekânsal Değişimin Metrik Analizi ile Değerlendirilmesi: Çanakkale Kent Merkezi
Authors: EREN Berivan , CENGİZ Tülay
Published: January 2023

Bu çalışmada Çanakkale kent merkezinde, peyzaj deseninde meydana gelen değişimin 18 yıllık süreçte analiz edilmesi amaçlanmıştır. Çalışmada peyzaj deseninde meydana gelen değişim, Landsat ETM 2000, 2006, 2012, 2018 WGS 84 projeksiyonunda Landsat Copernicus uydu görüntülerinin nesne tabanlı sınıflandırılması sonucunda elde edilen arazi kullanım/arazi örtüsü (AK/AÖ) haritaları üzerinden analiz edilmiştir. Araştırma alanında peyzaj desenleri olarak yapay alanlar, tarım alanları, doğal bitki örtüsü, sulak alanlar olmak üzere 4 sınıf ve bu sınıflandırmalara yönelik alanın kullanım durumuna uygun alt sınıflar kullanılmıştır. Peyzaj deseninde meydana gelen değişimin belirlenmesi için gerekli peyzaj metrikleri, FRAGSTATS V4.2. programı aracılığıyla hesaplanmıştır. Sınıf ve peyzaj düzeyinde; CA- Class Area (Sınıf Alanı), NumP- Number of Patches (Leke Sayısı), MPS- Mean Patch Size (Ortalama Leke Büyüklüğü), ED- Edge Density (Kenar Yoğunluğu), TE- Total Edge (Toplam Kenar), MCA- Mean Core Area (Ortalama Çekirdek Alan), TCA- Total Core Area (Toplam Çekirdek Alan), MNN- Mean Nearest Neighbor (Ortalama En Yakın Komşuluk Mesafesi), MPI- Mean Procimity Index (Ortalama Yakınlık İndeksi), SDI- Shannon’s Diversity Index (Shannon Çeşitlilik İndeksi), SEI- Shannon’s Evenness Index (Shannon Düzen İndeksi), MSI- Mean Shape Index (Ortalama Şekil İndeksi) metrikleri hesaplanmıştır. Yapılan hesaplamalar sonucunda peyzaj yapısındaki parçalanmaya bağlı değişimler analiz edilmiştir. Araştırma sonucunda, 2000-2018 yılları arasında leke büyüklüğünün yapısal alanlarda arttığı, orman alanları ve tarım alanlarında ise azaldığı tespit edilmiştir. 18 yıllık süreçte tarım alanlarında azalma yaşanmıştır. Sulak alanlarda çok belirgin bir değişim gözlemlenmemiştir. Üzüm bağları (vineyards) ve seyrek bitki örtüsünün (sparsely vegetated areas) olduğu alanlar değişime uğrayarak yerlerini başka peyzaj desenlerine bırakmıştır.