• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.285-294
• /
• 2021

In the present work we introduce Gaussian vertex prime labeling and investigate Gaussian vertex prime labeling for gear graph, book graph, wheel graph, kayak paddle, one point union of gear graph and one point union of wheel graph.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.227-237
• /
• 2016

In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v_f (i) − v_f (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e_f (0) − e_f (1)| ≤ 1 where v_f (x) denotes the number of vertices labeled with x, e_f (1) and e_f (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.

• Journal of applied mathematics & informatics
• /
• v.37 no.1_2
• /
• pp.149-156
• /
• 2019

Let G be a (p, q) graph. Let $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ be a map where $k{\in}{\mathbb{N}}$ and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if ${\mid}t_f(i)-t_f(j){\mid}{\leq}1$, $i,j{\in}\{1,2,{\ldots},k\}$ where $t_f$(x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1051-1060
• /
• 2009

In this paper, we give topological properties of collection of prime ideals in 2-primal near-rings. We show that Spec(N), the spectrum of prime ideals, is a compact space, and Max(N), the maximal ideals of N, forms a compact $T_1$-subspace. We also study the zero-divisor graph $\Gamma_I$(R) with respect to the completely semiprime ideal I of N. We show that ${\Gamma}_{\mathbb{P}}$ (R), where $\mathbb{P}$ is a prime radical of N, is a connected graph with diameter less than or equal to 3. We characterize all cycles in the graph ${\Gamma}_{\mathbb{P}}$ (R).

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.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.

• Kyungpook Mathematical Journal
• /
• v.62 no.3
• /
• pp.595-613
• /
• 2022

Let R be a commutative ring with identity and let I be a proper ideal of R. In this paper, we study the ideal based extended zero-divisor graph 𝚪'_I (R) and prove that 𝚪'_I (R) is connected with diameter at most two and if 𝚪'_I (R) contains a cycle, then girth is at most four girth at most four. Furthermore, we study affinity the connection between the ideal based extended zero-divisor graph 𝚪'_I (R) and the ideal-based zero-divisor graph 𝚪_I (R) associated with the ideal I of R. Among the other things, for a radical ideal of a ring R, we show that the ideal-based extended zero-divisor graph 𝚪'_I (R) is identical to the ideal-based zero-divisor graph 𝚪_I (R) if and only if R has exactly two minimal prime-ideals which contain I.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.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$.

• Journal of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1111-1121
• /
• 2012

A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. In this paper, we classify tetravalent symmetric graphs of order $9p$ for each prime $p$.

• Journal of the Korean Mathematical Society
• /
• v.55 no.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}])$.

• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.521-531
• /
• 2000

Graph C*-algebras C*(E) are the universal C*-algebras generated by partial isometries satisfying the Cuntz-Krieger relations determined by directed graphs E, and it is known that a simple graph C*-algebra is extremally rich in sense that it contains enough extreme consider a sufficient condition on a graph for which the associated graph algebra(possibly nonsimple) is extremally rich. We also present examples of nonextremally rich prime graph C*-algebras with finitely many ideals and with real rank zero.