A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for s
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