• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1323-1336
• /
• 2015

Let S be a semigroup with 0 and R be a ring with 1. We extend the definition of the zero-divisor graphs of commutative semigroups to not necessarily commutative semigroups. We define an annihilating-ideal graph of a ring as a special type of zero-divisor graph of a semigroup. We introduce two ways to define the zero-divisor graphs of semigroups. The first definition gives a directed graph ${\Gamma}$(S), and the other definition yields an undirected graph ${\overline{\Gamma}}$(S). It is shown that ${\Gamma}$(S) is not necessarily connected, but ${\overline{\Gamma}}$(S) is always connected and diam$({\overline{\Gamma}}(S)){\leq}3$. For a ring R define a directed graph ${\mathbb{APOG}}(R)$ to be equal to ${\Gamma}({\mathbb{IPO}}(R))$, where ${\mathbb{IPO}}(R)$ is a semigroup consisting of all products of two one-sided ideals of R, and define an undirected graph ${\overline{\mathbb{APOG}}}(R)$ to be equal to ${\overline{\Gamma}}({\mathbb{IPO}}(R))$. We show that R is an Artinian (resp., Noetherian) ring if and only if ${\mathbb{APOG}}(R)$ has DCC (resp., ACC) on some special subset of its vertices. Also, it is shown that ${\overline{\mathbb{APOG}}}(R)$ is a complete graph if and only if either $(D(R))^2=0,R$ is a direct product of two division rings, or R is a local ring with maximal ideal m such that ${\mathbb{IPO}}(R)=\{0,m,m^2,R\}$. Finally, we investigate the diameter and the girth of square matrix rings over commutative rings $M_{n{\times}n}(R)$ where $n{\geq} 2$.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.533-544
• /
• 2013

The multiplicative version of Wiener index (${\pi}$-index), proposed by Gutman et al. in 2000, is equal to the product of the distances between all pairs of vertices of a (molecular) graph G. In this paper, we first present some sharp bounds in terms of the order and other graph parameters including the diameter, degree sequence, Zagreb indices, Zagreb coindices, eccentric connectivity index and Merrifield-Simmons index for ${\pi}$-index of general connected graphs and trees, as well as a Nordhaus-Gaddum-type bound for ${\pi}$-index of connected triangle-free graphs. Then we study the behavior of ${\pi}$-index upon the case when removing a vertex or an edge from the underlying graph. Finally, we investigate the extremal properties of ${\pi}$-index within the set of trees and unicyclic graphs.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.909-912
• /
• 2010

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.105-115
• /
• 2003

An infinite locally finite plane graph is called an LV-graph if it is 3-connected and VAP-free. If an LV-graph G contains no unbounded faces, then we say that G is a 3LV-graph. In this paper, a structure theorem for an LV-graph concerning the existence of a sequence of systems of paths exhausting the whole graph is presented. Combining this theorem with the early result of the author, we obtain a necessary and sufficient conditions for an infinite VAP-free planar graph to be a 3LV-graph as well as an LV-graph. These theorems generalize the characterization theorem of Thomassen for infinite triangulations.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1275-1281
• /
• 2011

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1251-1264
• /
• 2005

Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. The competition number of a graph G, denoted by k(G), is the smallest number k such that G together with k isolated vertices is the competition graph of an acyclic digraph. It is known to be difficult to compute the competition number of a graph in general. Even characterizing the graphs with competition number one looks hard. In this paper, we continue the work done by Cho and Kim[3] to characterize the graphs with one hole and competition number one. We give a sufficient condition for a graph with one hole to have competition number one. This generates a huge class of graphs with one hole and competition number one. Then we completely characterize the graphs with one hole and competition number one that do not have a vertex adjacent to all the vertices of the hole. Also we show that deleting pendant vertices from a connected graph does not change the competition number of the original graph as long as the resulting graph is not trivial, and this allows us to construct infinitely many graph having the same competition number. Finally we pose an interesting open problem.

• Honam Mathematical Journal
• /
• v.41 no.1
• /
• pp.67-87
• /
• 2019

The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If n is a positive integer, a friendship graph $F_n$ consists of n edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $n{\neq}2$, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $F_n{\nabla}F_n$ is perfect.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.851-860
• /
• 2008

A countable locally finite triangulation is a strong triangulation if a representation of the graph contains no vertex- or edge-accumulation points. In this paper we exhibit the structure of an infinite strong triangulation and prove the existence of connected spanning subgraph with maximum degree 4 in such a graph

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.531-539
• /
• 2009

In this paper we first present a structure theorem for an infinite locally finite 3-connected VAP-free planar graph, and in connection with this result we study a possible classification of infinite locally finite planar graphs by reducing modulo finiteness.

• Journal of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.959-986
• /
• 2023

Zhai and Lin recently proved that if G is an n-vertex connected 𝜃(1, 2, r + 1)-free graph, then for odd r and n ⩾ 10r, or for even r and n ⩾ 7r, one has ${\rho}(G){\leq}{\sqrt{{\lfloor}{\frac{n^2}{4}}{\rfloor}}}$, and equality holds if and only if G is $K_{{\lceil}{\frac{n}{2}}{\rceil},{\lfloor}{\frac{n}{2}}{\rfloor}}$. In this paper, for large enough n, we prove a sharp upper bound for the spectral radius in an n-vertex H-free non-bipartite graph, where H is 𝜃(1, 2, 3) or 𝜃(1, 2, 4), and we characterize all the extremal graphs. Furthermore, for n ⩾ 137, we determine the maximum number of edges in an n-vertex 𝜃(1, 2, 4)-free non-bipartite graph and characterize the unique extremal graph.