In this paper, we introduce the class of demi-order norm continuous operators on a Banach lattice. We study relationship between order-to-norm and operators. also investigate some properties operators, it is given characterization lattice with order by term

For a graph G, let f(G) be the largest integer k such that there are two vertex-disjoint subgraphs of G each on k vertices, both inducing the same number of edges. We prove that f(G) ≥ n/2 − o(n) for every graph G on n vertices. This answers a question of Caro and Yuster.

This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily implementable and usable, as is. Finally, it is also simple to explain and understand.