• The Journal of the Convergence on Culture Technology
• /
• v.5 no.2
• /
• pp.367-373
• /
• 2019

As the number of Battery Electric Vehicle (BEV) is increasing dramatically Vehicle-to-Grid (V2G) te chnology also has been spotlight from industry and academia recently. With help of V2G technology Battery of EV can play many important roles like as energy storage system (ESS) and electric energy resource in Smart Grid environment. This paper provides comprehensive review of Vehicle-to-Home(V2H), Vehicle-to-Building(V2B) and Vehicle-to-Grid(V2G) technologies. The economical analysis of these technologies is also discussed.

• Journal of Energy Engineering
• /
• v.24 no.2
• /
• pp.129-143
• /
• 2015

Increasing concerns on climate change and energy security accelerated policies to reduce green-house gas emission, especially from the transportation sector. Electric vehicle (EV) has been on the spotlight to deal with such environmental issue and V2G (Vehicle-to-Grid) technology began to draw attentions as an alternative to reduce ownership costs while contributing to an efficient and decentralized power grid. This study conducts a scenario analysis on total cost of ownership of EV under V2G scheme and compare with non-V2G EV and Internal Combustion Engine (ICE) vehicle. As result, V2G service is expected to provide an annual average profit of $210 to EV users willing to reverse flow its residual power in the battery. The profit from V2G service leaves a margin of $4,530 over operational lifetime, compared with $2,420 cost of charge for non-V2G EV. In summary, total cost of ownership of V2G-capable EV was 6.2% less than non-V2G EV and 10.2% higher than ICE vehicle. The results confirm a comparative economic advantage of operating EV under V2G scheme. Increased number of EVs with V2G service has shown to provide positive effects to power industry for valley filling in load distribution, thus, favorably increasing the overall economic feasibility.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.345-351
• /
• 2022

For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.441-448
• /
• 2020

With help of Vehicle-to-Grid(V2G) technology battery in electric vehicle can be used as distributed energy resource and energy storage in a smart grid environment. Several problems of security vulnerability and privacy preservation can be occurred because V2G network supports 2 way communication among all components. This paper explains and makes analysis of architecture, privacy sensitive data, security vulnerability and security requirement of V2G system. Furthermore efficient architecture and operating scheme for V2G system are proposed. This scheme uses symmetric cryptosystem and hash algorithm to support privacy preservation and mutual authentication.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.193-204
• /
• 2022

A subset S of V(G), where G is a simple undirected graph, is a hop dominating set if for each v ∈ V(G)＼S, there exists w ∈ S such that d_G(v, w) = 2 and it is a locating-hop set if N_G(v, 2) ∩ S ≠ N_G(v, 2) ∩ S for any two distinct vertices u, v ∈ V(G)＼S. A set S ⊆ V(G) is a locating-hop dominating set if it is both a locating-hop and a hop dominating set of G. The minimum cardinality of a locating-hop dominating set of G, denoted by 𝛄_lh(G), is called the locating-hop domination number of G. In this paper, we investigate some properties of this newly defined parameter. In particular, we characterize the locating-hop dominating sets in graphs under some binary operations.

• Asian Journal of Turfgrass Science
• /
• v.22 no.1
• /
• pp.75-84
• /
• 2008

This study was carried out to examine the effects of cornstarch-based absorbent polymer (CAP) on the growth of cool season turfgrasses in sand-based soil mixture. Kentucky bluegrass + perennial ryegrass mixtures seeded at May 18 in 2006 on sand-based soil mixture. Sand + peat (5%, v/v), sand + CAP $20g{\cdot}m^{-2}$, sand + CAP $20g{\cdot}m^{-2}$ + peat (5%, v/v), and sand + CAP $40g{\cdot}m^{-2}$ + peat (5%, v/v) mixtures were compared. Ground coverage of sand + CAP $20g{\cdot}m^{-2}$ + peat (5%, v/v), and sand + CAP $40g{\cdot}m^{-2}$ + peat (5%, v/v) treatments showed 50% at a month after seeding. But the coverage of sand + peat (5%, v/v), sand + CAP $20g{\cdot}m^{-2}$ resulted in 36.7%. Mixing of CAP with sand was considered to be efficient method for increasing ground coverage as much as peat. Dry weight of turfgrass tiller at sand + CAP $20g{\cdot}m^{-2}$ + peat (5%, v/v), and sand + CAP $40g{\cdot}m^{-2}$ + peat (5%, v/v) were also significantly higher than sand + peat (5%, v/v), sand + CAP $20g{\cdot}m^{-2}$ mixtures at a month after seeding. Soil water retention at the sand + CAP $20g{\cdot}m^{-2}$, sand + CAP $40g{\cdot}m^{-2}$ + peat (5%, v/v) mixing were lower than sand + peat (5%, v/v) and sand + CAP $20g{\cdot}m^{-2}$ + peat (5%, v/v) during the dry periods. From the results, the mixing of CAP with sand is useful to increased ground coverage of kentucky bluegrass and perennial ryegrass.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.171-181
• /
• 2021

The fixing number of a graph G is the smallest order of a subset S of its vertex set V (G) such that the stabilizer of S in G, ��S(G) is trivial. Let G1 and G2 be the disjoint copies of a graph G, and let g : V (G1) → V (G2) be a function. A functigraph FG consists of the vertex set V (G1) ∪ V (G2) and the edge set E(G1) ∪ E(G2) ∪ {uv : v = g(u)}. In this paper, we study the behavior of fixing number in passing from G to FG and find its sharp lower and upper bounds. We also study the fixing number of functigraphs of some well known families of graphs like complete graphs, trees and join graphs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.1009-1023
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )