• Honam Mathematical Journal
• /
• v.36 no.2
• /
• pp.399-415
• /
• 2014

We study the Seifert surfaces of a link by relating the embeddings of graphs with induced graphs. As applications, we prove that every link L is the boundary of an oriented surface which is obtained from a graph embedding of a complete bipartite graph $K_{2,n}$, where all voltage assignments on the edges of $K_{2,n}$ are 0. We also provide an algorithm to construct such a graph diagram of a given link and demonstrate the algorithm by dealing with the links $4^2_1$ and $5_2$.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.25-32
• /
• 2017

Let G be a graph and k is a positive integer. Hammack and Livesay in [The inner power of a graph, Ars Math. Contemp., 3 (2010), no. 2, 193-199] introduced a new graph operation $G^{(k)}$, called the $k^{th}$ inner power of G. In this paper, it is proved that if G is bipartite then $G^{(2)}$ has exactly three components such that one of them is bipartite and two others are isomorphic. As a consequence the edge frustration index of $G^{(2)}$ is computed based on the same values as for the original graph G. We also compute the first and second Zagreb indices and coindices of $G^{(2)}$.

• The Journal of Natural Sciences
• /
• v.12 no.1
• /
• pp.1-9
• /
• 2002

Let G be a connected graph on n vertices. The pebbling number of graph G, f(G), is the least m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. In this paper, we compute the pebbling number of the Petersen Graph. We also show that the pebbling number of the categorical Product G.H is (m+n)h where G is the complete bipartite graph $K_{m,n}$ and H is the complete graph with $h(\geq4)$ vertices.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.265-272
• /
• 2003

In this paper, we propose a novel improved algorithm for the rectangular decomposition technique for the purpose of performing data mining from large scaled database in a dynamic environment. The proposed algorithm performs the rectangular decompositions by transforming a binary matrix to bipartite graph and finding bicliques from the transformed bipartite graph. To demonstrate its effectiveness, we compare the proposed one which is based on the newly derived mathematical properties with those of other methods with respect to the classification rate, the number of rules, and complexity analysis.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1266-1275
• /
• 2004

Bioinformatics is concerned with the creation and development of advanced information and computational technologies for problems in biology. It is divided into genomics, proteomics and metabolimics. In metabolimics, an organism is represented by metabolic pathway, i.e., well-displayed graph, and so the graph drawing tool to draw pathway well is necessary to understand it comprehensively. In this paper, we design an improved drawing algorithm. It enhances the readability by making use of the bipartite graph. Also it is possible to draw large graph properly by considering the facts that metabolic pathway graph is scale-free network and is composed of circular components, hierarchic components and linear components.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• Kyungpook Mathematical Journal
• /
• v.49 no.2
• /
• pp.283-288
• /
• 2009

Let N be a zero-symmetric near-ring with identity and let ${\Gamma}(N)$ be a graph with vertices as elements of N, where two different vertices a and b are adjacent if and only if + = N, where is the ideal of N generated by x. Let ${\Gamma}_1(N)$ be the subgraph of ${\Gamma}(N)$ generated by the set {n ${\in}$ N : = N} and ${\Gamma}_2(N)$ be the subgraph of ${\Gamma}(N)$ generated by the set $N{\backslash}{\upsilon}({\Gamma}_1(N))$, where ${\upsilon}(G)$ is the set of all vertices of a graph G. In this paper, we completely characterize the diameter of the subgraph ${\Gamma}_2(N)$ of ${\Gamma}(N)$. In addition, it is shown that for any near-ring, ${\Gamma}_2(N){\backslash}M(N)$ is a complete bipartite graph if and only if the number of maximal ideals of N is 2, where M(N) is the intersection of all maximal ideals of N and ${\Gamma}_2(N){\backslash}M(N)$ is the graph obtained by removing the elements of the set M(N) from the vertices set of the graph ${\Gamma}_2(N)$.