• Title/Summary/Keyword: Connected

Search Result 13,480, Processing Time 0.039 seconds

A NOTE ON WEAKLY PATH-CONNECTED ORTHOMODULAR LATTICES

  • Park, Eun-Soon
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.513-519
    • /
    • 1997
  • We show that each orthomodular lattice containing only atomic nonpath-connected blocks is a full subalgebra of an irreducible path-connected orthomodular lattice and there is a path-connected orthomodualr lattice L containing a weakly path-connected full subalgebra C(x) for some element x in L.

  • PDF

THE CONNECTED DOUBLE GEODETIC NUMBER OF A GRAPH

  • SANTHAKUMARAN, A.P.;JEBARAJ, T.
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.1_2
    • /
    • pp.155-163
    • /
    • 2021
  • For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.

NOTE ON NONPATH-CONNECTED ORTHOMODULAR LATTICES

  • Park, Eun-Soon
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.2
    • /
    • pp.285-292
    • /
    • 1995
  • Some nonpath-connected orthomodular lattices are given : Every infinite direct product of othomodular lattices containing infinitely many non-Boolean factors is a nonpath-connected orthomodular lattice. The orthomodular lattice of all closed subspaces of an infinite dimensional Hilbert space is a nonpath-connected orthomodular lattice.

  • PDF

ON SEQUENTIALLY g-CONNECTED COMPONENTS AND SEQUENTIALLY LOCALLY g-CONNECTEDNESS

  • Vijayashanthi, Palanichamy
    • Korean Journal of Mathematics
    • /
    • v.29 no.2
    • /
    • pp.355-360
    • /
    • 2021
  • In this paper, we introduce the definition of sequentially g-connected components and sequentially locally g-connected by using sequentially g-closed sets. Moreover, we investigate some characterization of sequentially g-connected components and sequentially locally g-connected.

Connected geodesic number of a fuzzy graph

  • Rehmani, Sameeha;Sunitha, M.S.
    • Annals of Fuzzy Mathematics and Informatics
    • /
    • v.16 no.3
    • /
    • pp.301-316
    • /
    • 2018
  • In this paper, the concept of connected geodesic number, $gn_c(G)$, of a fuzzy graph G is introduced and its limiting bounds are identified. It is proved that all extreme nodes of G and all cut-nodes of the underlying crisp graph $G^*$ belong to every connected geodesic cover of G. The connected geodesic number of complete fuzzy graphs, fuzzy cycles, fuzzy trees and of complete bipartite fuzzy graphs are obtained. It is proved that for any pair k, n of integers with $3{\leq}k{\leq}n$, there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) on n nodes such that $gn_c(G)=k$. Also, for any positive integers $2{\leq}a<b{\leq}c$, it is proved that there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) such that the geodesic number gn(G) = a and the connected geodesic number $gn_c(G)=b$.

Modeling and Control of a Grid Connected VSI using a Delta Connected LCL Filter ($\Delta$-결선 LCL 필터를 사용하는 삼상 계통 연계 인버터의 모델링과 제어)

  • Lee, Sang-In;Lee, Kui-Jun;Hyun, Dong-Seok
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.14 no.1
    • /
    • pp.1-7
    • /
    • 2009
  • There are two ways to connect an LCL filter in a grid-connected VSI. A wye connected LCL filter is general way, and the other is a delta connected LCL filter. While a model of a system with a wye connected LCL filter is calculated, a model of a system with a delta connected LCL filter is not formulated. Thus, we propose a mathematical model of a system with a delta connected LCL filter. Also, a comparative study of capacitor current harmonics of a delta connected LCL filter and a wye connected LCL filter is included. Experimental results exhibit that it is advantageous to control grid currents for a system with a delta connected LCL filter.

Security Threat Analysis for Remote Monitoring and Control Functions of Connected Car Services

  • Jin Kim;Jinho Yoo
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.173-184
    • /
    • 2024
  • The connected car services are one of the most widely used services in the Internet of Things environment, and they provide numerous services to existing vehicles by connecting them through networks inside and outside the vehicle. However, although vehicle manufacturers are developing services considering the means to secure the connected car services, concerns about the security of the connected car services are growing due to the increasing number of attack cases. In this study, we reviewed the research related to the connected car services that have been announced so far, and we identified the threats that may exist in the connected car services through security threat modeling to improve the fundamental security level of the connected car services. As a result of performing the test to the applications for connected car services developed by four manufacturers, we found that all four companies' applications excessively requested unnecessary permissions for application operation, and the apps did not obfuscate the source code. Additionally, we found that there were still vulnerabilities in application items such as exposing error messages and debugging information.

LOCAL CONNECTEDNESS IN FELL TOPOLOGY

  • Hur, K.;Moon, J.R.;Rhee, C.J.
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.6
    • /
    • pp.1047-1059
    • /
    • 1999
  • Let $C(X)(C_{K}(X))$ denote the hyperspace of all nonempty closed connected subsets (subcontinua) of a locally compact Haus-dorff space X with the Fell topology. We prove that the following statements are equivalent: (1) X is locally connected. (2) C(X) is locally connected,. (3) C(X) is locally connected at each $E{\in}C_{k}(X).(4) C_{k}(X)$ is locally connected.

  • PDF

ON ARCWISE CONNECTEDNESS IM KLEINEN IN HYPERSPACES

  • Baik, Bong Shin;Rhee, Choon Jai
    • The Pure and Applied Mathematics
    • /
    • v.20 no.1
    • /
    • pp.71-78
    • /
    • 2013
  • Let X be a space and $2^X$(C(X);K(X);$C_K$(X)) denote the hyperspace of nonempty closed subsets(connected closed subsets, compact subsets, subcontinua) of X with the Vietoris topology. We investigate the relationships between the space X and its hyperspaces concerning the properties of connectedness im kleinen. We obtained the following : Let X be a locally compact Hausdorff space. Let $x{\in}X$. Then the following statements are equivalent: (1) X is connected im kleinen at $x$. (2) $2^X$ is arcwise connected im kleinen at {$x$}. (3) K(X) is arcwise connected im kleinen at {$x$}. (4) $C_K$(X) is arcwise connected im kleinen at {$x$}. (5) C(X) is arcwise connected im kleinen at {$x$}.

SPB(Seamlessness-Privacy-Benefit) Paradigm for Construction of Highly-Connected Information Society (고도 정보 연계 사회의 구축을 위한 SPB(Seamlessness-Privacy-Benefit) 패러다임)

  • Lee, Kyoung-Jun;Jun, Jung-Ho
    • Journal of Information Technology Services
    • /
    • v.11 no.2
    • /
    • pp.131-146
    • /
    • 2012
  • The purpose of this research is two-fold : (1) we propose the paradigm to construct a connected information society according to a judgment where a coming information society will evolve into highly-connected information society having "seamlessness" as a keyword, and (2) we draw guidelines to construct infrastructures and establish systems and business models of highly-connected information society based on suggested paradigm. To achieve this, this research conducts the followings. First, we suggest reasons why a coming information society can be appropriate to be considered as highly-connected information society by examining two perspectives on the coming information society. Second, we explain the definition and characteristics of highly-connected information society and propose the SPB paradigm. Third, we analyze the utility of SPB paradigm by evaluating practices. Finally, we suggest four strategies to construct highly-connected information society based on advanced research findings and future research directions.