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

In this paper we prove that if G is a finite group, $^2D_{n}(3)(9{\le}n = 2^m + 1\;not a prime)$, G and M have the same order components, then G$\cong$M.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.653-659
• /
• 2009

It is proved that if $M\;=\;B_p(3)$ or $C_p(3)$, p is an odd prime, G is a finite group and has the same order components of M, then $G\;{\cong}\;Bp(3)$ or $C_p(3)$.

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.651-659
• /
• 2013

A graph is $s$-regular if its automorphism group acts regularly on the set of its $s$-arcs. In this paper, the cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p are classified for each $s{\geq}1$ and each prime $p$. The number of cubic $s$-regular graphs of order 12p, 36p, 44p, 52p, 66p, 68p and 76p is 4, 3, 7, 8, 1, 4 and 1, respectively. As a partial result, we determine all cubic $s$-regular graphs of order 70p except for $p$ = 31, 41.

• Bulletin of the Korean Mathematical Society
• /
• 제57권3호
• /
• pp.739-750
• /
• 2020

A simple graph is called semisymmetric if it is regular and edge transitive but not vertex transitive. Let p be a prime. Folkman proved [J. Folkman, Regular line-symmetric graphs, Journal of Combinatorial Theory 3 (1967), no. 3, 215-232] that no semisymmetric graph of order 2p or 2p² exists. In this paper an extension of his result in the case of cubic graphs of order 34p³, p ≠ 17, is obtained.

• Journal of applied mathematics & informatics
• /
• 제35권1_2호
• /
• pp.83-93
• /
• 2017

The Cayley graph ${\Gamma}=Cay(G,S)$ is called normal edge-transitive if $N_A(R(G))$ acts transitively on the set of edges of ${\Gamma}$, where $A=Aut({\Gamma})$ and R(G) is the regular subgroup of A. In this paper, we determine all hexavalent normal edge-transitive Cayley graphs on groups of order pqr, where p > q > r > 2 are prime numbers.

• Journal of the Korean Mathematical Society
• /
• 제46권2호
• /
• pp.313-325
• /
• 2009

We consider zero-divisor graphs with respect to primal, nonprimal, weakly prime and weakly primal ideals of a commutative ring R with non-zero identity. We investigate the interplay between the ringtheoretic properties of R and the graph-theoretic properties of ${\Gamma}_I(R)$ for some ideal I of R. Also we show that the zero-divisor graph with respect to primal ideals commutes by localization.

• Bulletin of the Korean Mathematical Society
• /
• 제53권1호
• /
• pp.139-151
• /
• 2016

A k-total-coloring of a graph G is a coloring of $V{\cup}E$ using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ of G is the smallest integer k such that G has a k-total-coloring. Let G be a planar graph with maximum degree ${\Delta}$. In this paper, it's proved that if ${\Delta}{\geq}7$ and G does not contain adjacent 5-cycles, then the total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ is ${\Delta}+1$.

• Bulletin of the Korean Mathematical Society
• /
• 제49권3호
• /
• pp.573-580
• /
• 2012

A (1, ${\lambda}$)-embedded graph is a graph that can be embedded on a surface with Euler characteristic ${\lambda}$ so that each edge is crossed by at most one other edge. A graph $G$ is called ${\alpha}$-linear if there exists an integral constant ${\beta}$ such that $e(G^{\prime}){\leq}{\alpha}v(G^{\prime})+{\beta}$ for each $G^{\prime}{\subseteq}G$. In this paper, it is shown that every (1, ${\lambda}$)-embedded graph $G$ is 4-linear for all possible ${\lambda}$, and is acyclicly edge-($3{\Delta}(G)+70$)-choosable for ${\lambda}$ = 1, 2.

• Journal of the Korean Mathematical Society
• /
• 제55권6호
• /
• pp.1381-1388
• /
• 2018

Let ${\Delta}$ be a simplicial complex, $I_{\Delta}$ its Stanley-Reisner ideal and $K[{\Delta}]$ its Stanley-Reisner ring over a field K. Assume that ${\Gamma}(R)$ denotes the zero-divisor graph of a commutative ring R. Here, first we present a condition on two reduced Noetherian rings R and R', equivalent to ${\Gamma}(R){\cong}{\Gamma}(R{^{\prime}})$. In particular, we show that ${\Gamma}(K[{\Delta}]){\cong}{\Gamma}(K^{\prime}[{\Delta}^{\prime}])$ if and only if ${\mid}Ass(I_{\Delta}){\mid}={\mid}Ass(I_{{{\Delta}^{\prime}}}){\mid}$ and either ${\mid}K{\mid}$, ${\mid}K^{\prime}{\mid}{\leq}{\aleph}_0$ or ${\mid}K{\mid}={\mid}K^{\prime}{\mid}$. This shows that ${\Gamma}(K[{\Delta}])$ contains little information about $K[{\Delta}]$. Then, we define the squarefree zero-divisor graph of $K[{\Delta}]$, denoted by ${\Gamma}_{sf}(K[{\Delta}])$, and prove that ${\Gamma}_{sf}(K[{\Delta}){\cong}{\Gamma}_{sf}(K[{\Delta}^{\prime}])$ if and only if $K[{\Delta}]{\cong}K[{\Delta}^{\prime}]$. Moreover, we show how to find dim $K[{\Delta}]$ and ${\mid}Ass(K[{\Delta}]){\mid}$ from ${\Gamma}_{sf}(K[{\Delta}])$.

• Journal of the Korea Society of Computer and Information
• /
• 제18권11호
• /
• pp.159-165
• /
• 2013

This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.