• 대한수학회지
• /
• 제45권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)$.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.127-133
• /
• 2005

An f-coloring of a graph G = (V, E) is a coloring of edge set E such that each color appears at each vertex v $\in$ V at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index $\chi'_f(G)$ of G. Any graph G has f-chromatic index equal to ${\Delta}_f(G)\;or\;{\Delta}_f(G)+1,\;where\;{\Delta}_f(G)\;=\;max\{{\lceil}\frac{d(v)}{f(v)}{\rceil}\}$. If $\chi'_f(G)$= ${\Delta}$f(G), then G is of $C_f$ 1 ; otherwise G is of $C_f$ 2. In this paper, the classification problem of complete graphs on f-coloring is solved completely.

• 충청수학회지
• /
• 제22권4호
• /
• pp.831-841
• /
• 2009

For a map f : A $\rightarrow$ X, we define and study a concept of $G^f$-space for a map, which is a generalized one of a G-space. Any G-space is a $G^f$-space, but the converse does not hold. In fact, $S^2$ is a $G^{\eta}$-space, but not G-space. We show that X is a $G^f$-space if and only if $G_n$(A, f,X) = $\pi_n(X)$ for all n. It is clear that any $H^f$-space is a $G^f$-space and any $G^f$-space is a $W^f$-space. We can also obtain some results about $G^f$-spaces in Postnikov systems for spaces, which are generalization of Haslam's results about G-spaces.

• 대한수학회지
• /
• 제32권4호
• /
• pp.689-695
• /
• 1995

Let G be a finite group with k distinct conjugacy classes $C_1, C_2, \cdots, C_k$ and F an algebraically closed field such that char$(F){\dag}\left$\mid$ G \right$\mid$$. We denoted by $Irr_F$(G) the set of all irreducible F-characters of G and $Cf_F$(G) the set of all class functions of G into F. Then $Cf_F$(G) is a commutative F-algebra with an F-basis $Irr_F(G) = {\chi_1, \chi_2, \cdots, \chi_k}$.

• 대한수학회보
• /
• 제53권1호
• /
• pp.91-102
• /
• 2016

A chief factor H/K of G is called F-central in G provided $(H/K){\rtimes}(G/C_G(H/K)){\in}{\mathfrak{F}}$. A normal subgroup N of G is said to be ${\pi}{\mathfrak{F}}$-hypercentral in G if either N = 1 or $N{\neq}1$ and every chief factor of G below N of order divisible by at least one prime in ${\pi}$ is $\mathfrak{F}$-central in G. The symbol $Z_{{\pi}{\mathfrak{F}}}(G)$ denotes the ${\pi}{\mathfrak{F}}$-hypercentre of G, that is, the product of all the normal ${\pi}{\mathfrak{F}}$-hypercentral subgroups of G. We say that a subgroup H of G is ${\pi}{\mathfrak{F}}$-embedded in G if there exists a normal subgroup T of G such that HT is s-quasinormal in G and $(H{\cap}T)H_G/H_G{\leq}Z_{{\pi}{\mathfrak{F}}}(G/H_G)$, where $H_G$ is the maximal normal subgroup of G contained in H. In this paper, we use the ${\pi}{\mathfrak{F}}$-embedded subgroups to determine the structures of finite groups. In particular, we give some new characterizations of p-nilpotency and supersolvability of a group.

• 대한수학회논문집
• /
• 제10권3호
• /
• pp.681-688
• /
• 1995

Fixed-point theory has an extension to coincidences. For a pair of maps $f,g:X_1 \to X_2$, a coincidence of f and g is a point $x \in X_1$ such that $f(x) = g(x)$, and $Coin(f,g) = {x \in X_1 $\mid$ f(x) = g(x)}$ is the coincidence set of f and g. The Nielsen coincidence number N(f,g) and the Lefschetz coincidence number L(f,g) are used to estimate the cardinality of Coin(f,g). The aspherical manifolds whose fundamental group has a normal solvable subgroup of finite index is called infrasolvmanifolds. We show that if $M_1,M_2$ are compact connected orientable infrasolvmanifolds, then $N(f,g) \geq $\mid$L(f,g)$\mid$$ for every $f,g : M_1 \to M_2$.

• 대한수학회논문집
• /
• 제12권3호
• /
• pp.709-715
• /
• 1997

For a fibration (E,B,p) with fiber F and a fiber map f, we show that if the inclusion $i : F \to E$ has a left homotopy inverse, then $G^f_n(E,F)$ is isomorphic to $G^f_n(F,E) \oplus \pi_n(B)$. In particular, by taking f as the identity map on E we have $G_n(E,F)$ is isomorphic to $G_n(F) \oplus \pi_n(B)$.

• 생명과학회지
• /
• 제18권4호
• /
• pp.454-460
• /
• 2008

본 연구는 콩의 Glycine tomentella와 G. max 뱀콩의 종간교잡으로부터 얻은 $F_1$식물체의 검증을 위하여 형태적, 세포 유전학적, 그리고 분자유전학적 연구를 하였던 바 그 결과를 요약하면 다음과 같다. $F_1$ 식물체의 암술과 수술, 꽃 색깔, 그리고 생육습관 등의 형태적 특징들은 G. tomentella의 특징들을 따르거나 중간적 특성을 나타내었다. G. tomentella (2n=38) 와 G. max 뱀콩(2n=40)의 $F_1$식물체의 염색체수는 2n=39를 가지고 있었다. Esterase와 peroxidase의 동위효소 반응의 결과에서도 $F_1$ 식물체는 G. tomentella과 G. max 뱀콩의 중간적인 밴드유형을 나타내었다. RAPD 분석결과 62 primers들로부터 얻은 $F_1$ 식물체 밴드양상이 모두 G. tomentella와 G. max 뱀콩 양친으로부터 물려받은 것들로 판명되었다. 형태적, 세포학적 그리고 분자유전학적 결과들을 종합하여 볼 때, 본 연구의 G. max와 G. tomentella의 종간교잡으로부터 얻은 $F_1$ 식물체는 진정 $F_1$ 교배체로 판명되었다. $F_1$ 식물체의 임성회복을 위한 연구와 RAPD 분석에서 나타난 모계유전양상(OPA02, OPA09)과 부계유전양상(OPD05)을 보인 결과에 대한 지속적인 연구를 위한 노력이 요구된다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.357-366
• /
• 2007

Let G(V, E) be a simple graph, and let f be an integer function on V with $1{\leq}f(v){\leq}d(v)$ to each vertex $v{\in}V$. An f-edge cover-coloring of a graph G is a coloring of edge set E such that each color appears at each vertex $v{\in}V$ at least f(v) times. The f-edge cover chromatic index of G, denoted by ${\chi}'_{fc}(G)$, is the maximum number of colors such that an f-edge cover-coloring of G exists. Any simple graph G has an f-edge cover chromatic index equal to ${\delta}_f\;or\;{\delta}_f-1,\;where\;{\delta}_f{=}^{min}_{v{\in}V}\{\lfloor\frac{d(v)}{f(v)}\rfloor\}$. Let G be a connected and not complete graph with ${\chi}'_{fc}(G)={\delta}_f-1$, if for each $u,\;v{\in}V\;and\;e=uv{\nin}E$, we have ${\chi}'_{fc}(G+e)>{\chi}'_{fc}(G)$, then G is called an f-edge covered critical graph. In this paper, some properties on f-edge covered critical graph are discussed. It is proved that if G is an f-edge covered critical graph, then for each $u,\;v{\in}V\;and\;e=uv{\nin}E$ there exists $w{\in}\{u,v\}\;with\;d(w)\leq{\delta}_f(f(w)+1)-2$ such that w is adjacent to at least $d(w)-{\delta}_f+1$ vertices which are all ${\delta}_f-vertex$ in G.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.383-388
• /
• 2007

A (g, f)-factor F of a graph G is Called a Hamiltonian (g, f)-factor if F contains a Hamiltonian cycle. The binding number of G is defined by $bind(G)\;=\;{min}\;\{\;{\frac{{\mid}N_GX{\mid}}{{\mid}X{\mid}}}\;{\mid}\;{\emptyset}\;{\neq}\;X\;{\subset}\;V(G)},\;{N_G(X)\;{\neq}\;V(G)}\;\}$. Let G be a connected graph, and let a and b be integers such that $4\;{\leq}\;a\;<\;b$. Let g, f be positive integer-valued functions defined on V(G) such that $a\;{\leq}\;g(x)\;<\;f(x)\;{\leq}\;b$ for every $x\;{\in}\;V(G)$. In this paper, it is proved that if $bind(G)\;{\geq}\;{\frac{(a+b-5)(n-1)}{(a-2)n-3(a+b-5)},}\;{\nu}(G)\;{\geq}\;{\frac{(a+b-5)^2}{a-2}}$ and for any nonempty independent subset X of V(G), ${\mid}\;N_{G}(X)\;{\mid}\;{\geq}\;{\frac{(b-3)n+(2a+2b-9){\mid}X{\mid}}{a+b-5}}$, then G has a Hamiltonian (g, f)-factor.