in this paper, a certain new connectedness of l-fuzzy subsets inl-topological spaces is introduced and studied by means of preclosed sets. itpreserves some fundamental properties of connected set in general topology.especially the famous k. fan’s theorem holds.

In this paper, a certain new connectedness of L-fuzzy subsets inL-topological spaces is introduced and studied by means of preclosed sets. Itpreserves some fundamental properties of connected set in general topology.Especially the famous K. Fan’s Theorem holds.

For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

A balanced coloring of a graph G means a triple {P1, P2,X} of mutually disjoint subsets of the vertex-set V (G) such that V (G) = P1⊎P2⊎X and |P1| = |P2|. A balanced decomposition associated with the balanced coloring V (G) = P1⊎P2⊎X of G is defined as a partition of V (G) = V1⊎· · ·⊎Vr (for some r) such that, for every i ∈ {1, · · · , r}, the subgraphG[Vi] of G is connected and |Vi∩P1| = |Vi∩P...

Consider two graphs X and Y, each with n vertices. The friends-and-strangers graph FS(X,Y) of Y is a vertex set consisting all bijections σ:V(X)↦V(Y), where σ, σ′ are adjacent if only they differ precisely on vertices X, the corresponding mappings in Y. most fundamental question that one can ask about these whether or not connected. Recently, Alon, Defant Kravitz showed independent random G(n,p...

A calculus is presented which allows an efficient treatment of the following components: Tenses, temporal conjunctions, temporal adverbials (of "definite" type), temporal quantifications and phases. The phases are a means for structuring the set of time-points t where a certain proposition is valid. For one proposition there may exist several "phase"-perspectives. The calculus has integrative p...