The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardi
This paper introduces the new notion of weakly-α-I-functions and weakly-α-I-paracompact spaces in the ideal topo-logical space. And it obtains that some prope
A formal-linguistic approach for solving an entertaining task is offered in this paper. The well-known task of the Hanoi towers is discussed in relation to some
A general-relativistic model is formulated for hypothetical ultra-compact astrophysical objects composed of fluid infused with charges carrying a generalized ma
Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored b