Titlebook: Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling; P. V. Subrahmanyam,V. Antony Vijesh,Prakash Veerar Book 2023 Th

CLAY

Note on Distributivity of Different String Operations Over Language Sets, Strings over an alphabet can be subjected to more operations like reverse-duplication, pseudo-duplication, etc. In this paper, we study the nature of the distribution of duplication, reverse-duplication and pseudo-duplication operations over the set operations like union, intersection and complemen

煞費苦心

WATER

,A Short Proof of Ore’s ,-Factor Theorem Using Flows,em. In this paper, we prove Ore’s theorem using flows in networks and our proof is simpler. A polynomial time (linear) algorithm . is derived to find an .-factor if it exists or else a . is found to prove the non-existence of an .-factor. The deficiency version of Ore’s theorem is given.

不利

Blemish

Role of Single Valued Linear Octagonal Neutrosophic Numbers in Multi-attribute Decision-Making Prob Single Valued Linear Octagonal Neutrosophic Numbers (SVLONNs) is introduced. Cut sets for truth membership, indeterminacy membership, and falsity membership degrees are defined and using the same arithmetic operations such as addition and scalar multiplication on the collection of SVLONNs are inves

Foment

mercenary

EWER

Experimental Evaluation of Four Intermediate Filters to Improve the Motion Field Estimation,placements and illumination changes, we tested it with four different filters: Bilateral filter (BF), Median filter (MF), Weighted median filter (WMF), and a new filter called a Balanced median filter (BMF). This BMF is a weighted sum of the Median filter and the Bilateral filter (BF) using an adapt

蝕刻術(shù)

,Herscovici’s Conjecture on Product of Some Complete Bipartite Graphs, to any target vertex, whenever the following inequality . holds. For any connected graph, . is the first pebbling conjecture which is proposed by Chung, called as Graham’s Conjecture. For finding the bounds of the .-pebbling number for the product of graphs, Lourdusamy extended this conjecture as .

輕推