• Title/Summary/Keyword: F.V.M.

Search Result 1,357, Processing Time 0.033 seconds

Hamiltonian Paths in Restricted Hypercube-Like Graphs with Edge Faults (에지 고장이 있는 Restricted Hypercube-Like 그래프의 해밀톤 경로)

  • Kim, Sook-Yeon;Chun, Byung-Tae
    • The KIPS Transactions:PartA
    • /
    • v.18A no.6
    • /
    • pp.225-232
    • /
    • 2011
  • Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

Odd Harmonious and Strongly Odd Harmonious Graphs

  • Seoud, Mohamed Abdel-Azim;Hafez, Hamdy Mohamed
    • Kyungpook Mathematical Journal
    • /
    • v.58 no.4
    • /
    • pp.747-759
    • /
    • 2018
  • A graph G = (V (G), E(G) of order n = |V (G)| and size m = |E(G)| is said to be odd harmonious if there exists an injection $f:V(G){\rightarrow}\{0,\;1,\;2,\;{\ldots},\;2m-1\}$ such that the induced function $f^*:E(G){\rightarrow}\{1,\;3,\;5,\;{\ldots},\;2m-1\}$ defined by $f^*(uv)=f(u)+f(v)$ is bijection. While a bipartite graph G with partite sets A and B is said to be bigraceful if there exist a pair of injective functions $f_A:A{\rightarrow}\{0,\;1,\;{\ldots},\;m-1\}$ and $f_B:B{\rightarrow}\{0,\;1,\;{\ldots},\;m-1\}$ such that the induced labeling on the edges $f_{E(G)}:E(G){\rightarrow}\{0,\;1,\;{\ldots},\;m-1\}$ defined by $f_{E(G)}(uv)=f_A(u)-f_B(v)$ (with respect to the ordered partition (A, B)), is also injective. In this paper we prove that odd harmonious graphs and bigraceful graphs are equivalent. We also prove that the number of distinct odd harmonious labeled graphs on m edges is m! and the number of distinct strongly odd harmonious labeled graphs on m edges is [m/2]![m/2]!. We prove that the Cartesian product of strongly odd harmonious trees is strongly odd harmonious. We find some new disconnected odd harmonious graphs.

RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS

  • Zhou, Sizhong;Zong, Minggang
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.6
    • /
    • pp.1613-1622
    • /
    • 2008
  • Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

[2,3]-FACTORS IN A 3-CONNECTED INFINITE PLANAR GRAPH

  • Jung, Hwan-Ok
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.27-40
    • /
    • 2002
  • For two integers m, n with m $\leq$ n, an [m,n]-factor F in a graph G is a spanning subgraph of G with m $\leq$ d$\_$F/(v) $\leq$ n for all v ∈ V(F). In 1996, H. Enomoto et al. proved that every 3-connected Planar graph G with d$\_$G/(v) $\geq$ 4 for all v ∈ V(G) contains a [2,3]-factor. In this paper. we extend their result to all 3-connected locally finite infinite planar graphs containing no unbounded faces.

The Study on the Upper-bound of Labeling Number for Chordal and Permutation Graphs (코달 및 순열 그래프의 레이블링 번호 상한에 대한 연구)

  • Jeong, Tae-Ui;Han, Geun-Hui
    • 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'.

  • PDF

Anodic oxidation behavior of AZ31 Mg alloy in aqueous solution containing various NaF concentrations

  • Moon, Sungmo;Kwon, Duyoung
    • Journal of the Korean institute of surface engineering
    • /
    • v.55 no.4
    • /
    • pp.196-201
    • /
    • 2022
  • This paper deals with anodic oxidation behavior of AZ31 Mg alloy in aqueous solutions containing various NaF concentrations from 0.01 M to 1 M. Three different voltage-time curves and anodic oxide formation behaviors appeared with concentration of NaF in deionized water. When NaF concentration is lower than 0.02 M, the voltage of AZ31 Mg alloy increased linearly and then reached a steady-state value more than 200 V, and large size pits and thin oxide layer were formed. When NaF concentration is between 0.05 M and 0.1 M, the voltage of AZ31 Mg alloy showed large periodic fluctuations of about 30 ~ 50 V around more than 200 V and large number of small particles were observed. If NaF concentration is higher than 0.2 M, PEO films can be formed without visible arcs under solution pH 6.5 ~ 7.5 by F- ions without help of OH- ions.

MID-INFRARED PERIOD-METALLICITY-LUMINOSITY RELATIONS AND KINEMATICS OF RR LYRAE VARIABLES

  • DAMBIS, ANDREI K.;BERDNIKOV, L.N.;KNIAZEV, A. YU.;KRAVTSOV, V.V.;RASTORGUEV, A.S.;SEFAKO, R.;VOZYAKOVA, O.V.;ZABOLOTSKIKH, M.V.
    • Publications of The Korean Astronomical Society
    • /
    • v.30 no.2
    • /
    • pp.183-187
    • /
    • 2015
  • We use ALLWISE data release W1- and W2-band epoch photometry collected by the Wide-Field Infrared Survey Explorer (WISE) to determine slopes of the period-luminosity relations for RR Lyrae stars in 15 globular clusters in the corresponding bands. We further combine these results with V- and K-band photometry of Galactic field RR Lyrae stars to determine the metallicity slopes of the log $P_F-[Fe/H]-M_K$, log $P_F-[Fe/H]-M_{W1}$, and log $P_F-[Fe/H]-M_{W2}$ period-metallicity-luminosity relations. We infer the zero points of these relations and determine the kinematical parameters of thick-disk and halo RR Lyraes via statistical parallax, and estimate the RR Lyrae-based distances to 18 Local-Group galaxies including the center of the Milky Way.

Cycle Embedding of Faulty Recursive Circulants (고장난 재귀원형군의 사이클 임베딩)

  • 박정흠
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.86-94
    • /
    • 2004
  • In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

m-ADIC RESIDUE CODES OVER Fq[v]/(v2 - v) AND DNA CODES

  • Kuruz, Ferhat;Oztas, Elif Segah;Siap, Irfan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.921-935
    • /
    • 2018
  • In this study we determine the structure of m-adic residue codes over the non-chain ring $F_q[v]/(v^2-v)$ and present some promising examples of such codes that have optimal parameters with respect to Griesmer Bound. Further, we show that the generators of m-adic residue codes serve as a natural and suitable application for generating reversible DNA codes via a special automorphism and sets over $F_{4^{2k}}[v]/(v^2-v)$.

The Kinetics of Hyperpolarization Activated Current$(i_f)$ in Sinoatrial Node of the Rabbit (토끼 동방결결에서 Pacemaker전류(과분극에 의해 활성화되는 내향전류, $i_f$)의 동력학적 특성에 관한 연구)

  • Earm, Yung-E
    • The Korean Journal of Physiology
    • /
    • v.17 no.1
    • /
    • pp.1-11
    • /
    • 1983
  • 1) The two microelectrode method was used to voltage clamp small preparations of rabbit sinoatrial node. The kinetics of hyperpolarization activated inward current, $i_f$ were analysed. 2) The hrperpolarization pulses activated $i_f$ current in the presence of $10^{-7}g/ml$ TTX and 2 mM $Mn^{2+}$. The activation range was in between -45 mV to -75 mV. The current magnitude was increased and time course was faster by strong hyperpolarization pulses. 3) Standard envelope tests indicated that this current is exponentially controlled by single gate. 4) Semilogarithmic plot of $i_f$ activation versus time was found to be linear in the activation range. The decrease in current magnitude and the shifts in activation curve and rate constants curve to the hyperpolarizing direction were obtained with $Ba^{2+}$, indicating that $Ba^{2+}$ shifts the voltage dependence of the gating kinetics, were partially reversed by 24 mM $K^+$.

  • PDF