Proyecciones (Antofagasta, On line)

The Connected and Forcing Connected Restrained Monophonic Numbers of a Graph

Ganesamoorthy K., Santhakumaran A.P., Titus P. — Wed, 03 Apr 2024 00:00:00 +0000

For a connected graph G = (V,E) of order at least two, a connected restrained monophonic set S of G is a restrained monophonic set such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected restrained monophonic set of G is the connected restrained monophonic number of G and is denoted by mcr(G). We determine bounds for it and find the same for some special classes of graphs. It is shown that, if a, b and p are positive integers such that 3 ≤ a ≤ b ≤ p, p−1 6= a, p−1 6= b, then there exists a connected graph G of order p, mr(G) = a and mcr(G) = b. Also, another parameter forcing connected restrained monophonic number fcrm(G) of a graph G is introduced and several interesting results and realization theorems are proved.

Common Multiples of Paths and Stars with Crowns

Saritha Chandran C, Reji T — Wed, 03 Apr 2024 00:00:00 +0000

{\footnotesize A graph $G$ is a common multiple of two graphs $H_1$ and $H_2$ if there exists a decomposition of $G$ into edge-disjoint copies of $H_1$ and also a decomposition of $G$ into edge-disjoint copies of $H_2$. If $ G $ is a common multiple of $H_1$ and $H_2$, and $ G $ has $ q $ edges, then we call $ G $ a $ (q, H_1, H_2) $ graph. Our paper deals with the following question: Given two graphs $ H_1 $ and $ H_2$, for which values of $ q $ does there exist a $ (q, H_1, H_2) $ graph? when $H_1$ is either a path or a star with $3$ or $4$ edges and $H_2$ is a crown.
}

Some remarks on summability defined by invariant mean in intuitionistic fuzzy 2-normed spaces

Sumaira Aslam, Vijay Kumar, Archana Sharma — Wed, 03 Apr 2024 00:00:00 +0000

In present paper, we aim to define a new summability method using σ-mean called σ-statistical summability in an intuitionistic fuzzy 2- normed space (briefly IF2NS). We also define σ-statistical cauchy sequence in an IF2NS and study some of their properties. We display example that shows our method of summability is more stronger in these spaces.

MAXIMAL GRAPHICAL REALIZATION OF A TOPOLOGY

Ullas Thomas, Sunil C Mathew — Wed, 03 Apr 2024 00:00:00 +0000

Given a topological space, the graphical realizations of it with as many edges as possible, called maximal graphical realizations, are studied here. Every finite topological space admits a maximal graphical realization. However, there are graphs which are not maximal graphical realizations of any topology. A tree of odd order is never a maximal graphical realization of a topological space. Maximal graphical realization of a topology is a cycle if and only if it is C_3. It is shown that chain topologies admit unique maximal graphical realizations. A lower bound for the size of a maximal graphical realization is also obtained.

A study on derivations of inverse semirings with involution

Dr. Madhu Dadhwal, Geeta Devi — Wed, 03 Apr 2024 00:00:00 +0000

In this research article, we study the influence of derivations on semirings with involution which resembles with commutativity preserving mappings. The action of derivations on Lie ideals and some differential identities regarding Lie ideals are also investigated. It is proved that for any two derivations d1, d2 of a prime semiring S with involution ⋆ such that atleast one of d₁, d₂ is nonzero and char(S) 2, then the identity [d₁(a), d₂(a ^⋆ )] + d₂(a ◦ a ^⋆ ) = 0, for all a ∈ L implies [L , S] = (0), where L is a Lie ideal of S.

A semilinear non-homogeneous problem related to Korteweg-de Vries Equation

Yassine Benia — Wed, 03 Apr 2024 00:00:00 +0000

In this paper, we consider a non-homogeneous generalized Korteweg-de Vries problem with some hypotheses on the right-hand side, and we give a new regularity result of the solution in an anisotropic Sobolev space. Then we apply the obtained result to a non-homogeneous KdV problem. This work is an extension of solvability results for a right-hand side f in Lebesgue space.

An optimization model for fuzzy nonlinear programming with Beale's conditions using trapezoidal membership functions

Palanivel Kaliyaperumal, Muralikrishna P — Fri, 05 Apr 2024 00:00:00 +0000

Non-linear Programming (NLP) is an optimization technique for determining the optimum solution to a broad range of research issues. Many times, the objective function is non-linear, owing to various economic behaviors such as demand, cost, and many others. Since the appearance of Kuhn and Tucker's fundamental theoretical work, a general NLP problem can be resolved using many methods to find the optimum solution. In this chapter, a fuzzy mathematical model based on Beale's condition is proposed to address NLP with inequality constraints in terms of fuzziness. Furthermore, the model demonstrates how quadratic programming problems can be solved using membership functions. The model also describes three stages: that is, mathematical formulation, computational procedures, and numerical illustration with comparative analysis. Likewise, the model illustrates the considered problem using two distinct approaches, namely membership functions (MF) and robust ranking index. Finally, the comparison analysis provides detailed results and discussion that justify the optimal outcome in order to address the vagueness of certain NLPPs.

A note on local edge antimagic chromatic number of graphs

Fawwaz Fakhrurrozi Hadiputra, Tita Khalis Maryati — Wed, 03 Apr 2024 00:00:00 +0000

Let $G$ be a finite, undirected and simple graph. A bijection $f : V(G) \to [1,|V(G)|]$ is called a local edge antimagic labeling if for any two adjacent edges $uv,vw \in E(G), f(u) \ne f(w)$. The local edge antimagic chromatic number $\ch(G)$ is the minimum number of colors taken over all colorings induced by local edge antimagic labeling of $G$. In this paper, we investigate characterization of graphs $G$ with small number $\ch(G)$, relationship between local edge antimagic chromatic number $\ch(G)$ and edge independence number $\alpha'(G)$, and bounds of $\ch(G)$ for any graphs.

On derivations over trivial extensions

brahim boudine, Mohammed Zerra — Wed, 03 Apr 2024 00:00:00 +0000

In this paper, we investigate the structure of derivations over trivial extensions. We provide a detailed analysis of the structure of derivations on trivial extensions, the centre of trivial extensions, and the conditions for a trivial extension to be prime. Additionally, we examine the structure of derivations on trivial extensions when the underlying ring, $R$, is a prime ring, under the conditions of Herstein's Theorem, Posner's Theorem, and Bell's theorem.

On local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs

Nalliah M — Wed, 03 Apr 2024 00:00:00 +0000

Let $G$ be a graph on $p$ vertices and $q$ edges with no isolated vertices. A bijection $f: V\rightarrow \{1,2,3,...,p\}$ is called local distance antimagic labeling, if for any two adjacent vertices $u$ and $v$, we have $w(u) \neq w(v)$, where $w(u)=\sum_{x\epsilon N(u)} {f(x)}$. The local distance antimagic chromatic number $\chi_{lda}(G)$ is defined to be the minimum number of colors taken over all colorings of $G$ induced by local distance antimagic labelings of $G$. In this paper, we obtained the necessary and sufficient condition for the local distance antimagic chromatic number of some disjoint union of graphs with 1-regular graphs equal to the number of distinct neighbors of its pendant vertices. We also gave a correct result in [Local Distance Antimagic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1(2021)].%magic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1

Higher order mKdV breathers: nonlinear stability

MIGUEL A ALEJO — Wed, 03 Apr 2024 00:00:00 +0000

We are interested in stability results for breather solutions of the 5th, 7th and 9th order mKdV equations.
We show that these higher order mKdV breathers are stable in $H^2(\R)$, in the same way as \emph{classical} mKdV breathers.
We also show that breather solutions of the 5th, 7th and 9th order mKdV equations satisfy the same stationary fourth order
nonlinear elliptic equation as the mKdV breather, independently of the order, 5th, 7th or 9th, considered.

Antimagic Labeling for Some Snake Graphs

Chirag Barasara, Palak Prajapati — Fri, 05 Apr 2024 00:00:00 +0000

A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake, double alternate quadrilateral snake.