International Journal Of Mathematics And Computer Research

On Contra hc-Continuous Functions

2025-02-01T12:35:09+00:00

In this paper, by means of hс −pen sets, we introducе and investigate certain ramifications of сontra − сontinuous and allied functions, namely, сontra hс− сontinuous , perfectly сontra hс− Functions, сontra hс− open functions and сontra hс −сlosed functions . along with their several properties, characterizations and mutual relationships. Further, we introduce new type of graphs, called сontra hс− сlosed graphs via hс− open sets. The relationship between these graphs and contra hс− continuous unctions are studied .

On the heptadiagonal matrix CL factorization

2025-02-03T10:48:16+00:00

The main contribution of this paper is a new CL type decomposition of heptadiagonal matrices
for fast inversion. We further provide two algorithms and study their execution times to measure
the benefit of the proposed decomposition. Therefore, we are able to obtain a number of
interesting results.

The Maximum Reduced Sombor Index of Unicyclic Graphs in terms of the Girth

2025-02-15T11:16:43+00:00

The Reduced sombor index is defined as

A unicyclic graph is a graph with exactly one cycle. The unicyclic graphs are well-studied for other topological indices. The Reduced sombor index is studied in this article and proved novel results on the bounds with the restrictions to the unicyclic graphs. This work concentrates on the extreme values of the Reduced sombor index. We propose a maximum value for the Reduced sombor index of unicyclic graph and the unicyclic graphs attaining the maximum Reduced Sombor index are achieved.

Properties of a Certain Subclass of Multivalent Function Defined by using Generalized Ruscheweyh Derivative

2025-02-08T15:07:59+00:00

In this research paper, we work on various analytic and geometric properties of a new subclass of analytic and multivalent function defined under the open unit disk by using generalized ruscheweyh derivative operator. These properties mainly include Radii of close – to – convexity, starlikeness and convexity, arithmetic mean property and convex set property for the analytic and multivalent function belonging to this new subclass.

On the Minimum Modified Sombor Index of the Unicyclic Graphs by the Restrictions on the Girth

2025-02-07T11:13:08+00:00

The Modified Sombor Index of a graph G is defined as the reciprocal of the well known Sombor Index. The girth of G, by short g(G), is the length of the smallest cycle in G. A graph with exactly one cycle is a unicyclic graph. If it is further, connected, it is a connected unicyclic graph. In this article, we achieved the minimum and second minimum modified Sombor Index of unicyclic graphs and also found the graphs achieving the minimum and second minimum modified Sombor Index.

Optimal Control of Linear Delay Systems with Delays in State and Control

2025-02-10T08:20:38+00:00

This paper extends the work of [6] to establish sufficient conditions for the existence and uniqueness of optimal control of linear delay systems with distributed delays in state and control. It is shown that if the system is relatively controllable, the optimal control is unique and bang bang and is of the form

Common Fixed Point under New Contraction Framework in Digital Metric Spaces

2025-02-10T10:52:46+00:00

This paper presents a common fixed-point theorem for a pair of weakly commutative mappings within the framework of a digital metric space, satisfying a specific contractive condition. The results obtained expand and generalize several well-established findings in the existing literature.

The Selection Model of Scholarship Recipients using a Combination of Best Worst Method, SMART and PROMETHEE

2025-02-10T11:51:15+00:00

This research aims to develop a model for selecting scholarship recipients using a combination of the Best Worst Method, SMART and PROMETHEE. The topic was chosen due to the importance of an objective and transparent selection process to improve access to higher education for underprivileged students. The Best Worst Method is used to determine criteria weights by comparing the best and worst criteria. SMART evaluates the utility value of alternatives based on the weights obtained from the Best Worst Method. PROMETHEE ranks the alternatives based on preference values calculated from SMART results. The results showed that this combination achieved an accuracy of 96,29%, precision of 96,67%, recall of 96,67%, and specificity of 96,67%. In the sensitivity analysis, based on 20 weight change experiments, resulted in an average value of 0,863, indicating the superiority of this method compared to others. These findings suggest that this combination is more robust to weight changes, making it more effective in maintaining consistency and objectivity during the selection process. Applying Best Worst Method, SMART and PROMETHEE enhances the quality of scholarship selection, ensuring fairness, objectivity and consistency in various decision-making situations.

A Numerical Method for Inverting Bordered k-Tridiagonal Matrices

2025-02-10T12:25:36+00:00

We develop a new algorithm to compute the inverse of an interesting class of bordered ktridiagonal matrices. This algorithm relieson a novel strategy of partitioning and decomposition. We also give examples illustrating the efficiency of the proposed method.

Metacognitive Strategies in Problem-Based Learning: What They Are and How to Implement Them?

2025-02-18T06:05:06+00:00

Metacognitive strategies are techniques or approaches used to help students understand and control their own thinking processes, including the abilities to plan, monitor, and evaluate their learning. In the context of Problem Based Learning (PBL), these strategies assist students not only in deeply understanding the material but also in enhancing their ability to organize and reflect on how they solve problems independently. This article employs a Systematic Literature Review (SLR) method to identify and analyze the fundamental concepts of metacognitive strategies, their roles in PBL, and effective implementation steps in the classroom. Key components discussed include task planning techniques, monitoring of understanding, and reflection on outcomes. The findings indicate that the application of metacognitive strategies within PBL can strengthen students' learning independence, improve critical thinking skills, and foster their confidence in tackling complex problems. Furthermore, the implementation of these strategies encourages students to be more active and reflective in their learning processes, contributing to a deeper and more sustainable understanding of the material.

Graceful labeling of posets

2025-02-21T10:21:09+00:00

The concept of graph labeling was introduced in mid-1960 by Rosa. In this paper,
we introduce a notion of graceful labeling of a finite poset. We obtain graceful
labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare,
Pawar, and Waphare introduced the ‘adjunct’ operation of two lattices with respect
to an adjunct pair of elements. We obtain the graceful labeling of an adjunct sum
of two chains with respect to an adjunct pair (0, 1).