\mu - k - Connectedness in GTS | Zendy

Shyamapada Modak | Zendy; Takashi Noiri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

\mu - k - Connectedness in GTS

Author(s) -

Shyamapada Modak,

Takashi Noiri

Publication year - 2014

Publication title -

boletim da sociedade paranaense de matemática

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.347

H-Index - 15

eISSN - 2175-1188

pISSN - 0037-8712

DOI - 10.5269/bspm.v33i2.23419

Subject(s) - closure (psychology) , social connectedness , combinatorics , physics , beta (programming language) , mathematics , discrete mathematics , computer science , psychology , programming language , economics , market economy , psychotherapist

Csaszar [5] introduced \mu - semi - open sets, \mu - preopen sets, \mu - \alpha - open sets and \mu - \beta - open sets in a GTS (X, \tau). By using the \mu - \sigma - closure, \mu - \pi - closure, \mu - \alpha - closure and \mu - \beta - closure in (X, \tau), we introduce and investigate the notions \mu - k - separated sets and \mu - k - connected sets in (X, \tau)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research