In 2012, Das [5] had obtained a lower bound on the neces- sary number of parity-check digits in an (n = n₁ + n₁, k) linear codes over GF(2) which are optimal in a speci c sense viz. which are capa- ble to correct single ...

We explicitly derive diagrams representing (1,1)-decompositionsof rational pretzel knots Kβ = M((-2, 1), (3, 1), (|6β + 1|, β)) from fourunknotting tunnels for β = 1, -2 and 2.

Let G be a graph with vertex set V , edge set E and Z2 = {0, 1}. Let f be a labeling from E to Z2, so that the labels of the edges are 0 or 1. The edges labelled 1 are called 1-edges and edges labelled 0 are called 0-edges. ...

Inthis paper, we present some results on distancemagic labeling of generalized Mycielskian graphs.

This paper presents families of q-ary projectivelinear codes, where q represents a prime power. Certain classesof linear codes obtained over Fq yield optimal projective codesthat meet the Griesmer bound.

We shall beconsidering three situations for the ring R depending on the prime 2 beinginert, ramified, and split for the ring of integers.

In this paper, we introduce and investigate new graph parametersbased on boundary relationships among vertices.

Specifically, we aim to establishprecise bounds for the total chromatic number within theseclasses, contributing to a better understanding of the conjecture’svalidity

This paper aims to establish the notion of Hammingdistance under the Possibility environment and proposea Multi-Attribute Decision-Making (MADM) strategy basedon the Technique for Ordering Preference by Similarity toIdeal ...

A special case of the Komlos- S ´ os´conjecture that states the following: Let k ∈ N. If atleast half the vertices of a graph G have degree at leastk, then G contains as subgraphs, all trees of size k + 1 isthen verified.