• 대한수학회보
• /
• 제44권4호
• /
• pp.709-719
• /
• 2007

In [8], it is shown that the complete multipartite graph $K_{n(2t)}$ having n partite sets of size 2t, where $n{\geq}6\;and\;t{\geq}1$, has a decomposition into gregarious 6-cycles if $n{\equiv}0,1,3$ or 4 (mod 6). Here, a cycle is called gregarious if it has at most one vertex from any particular partite set. In this paper, when $n{\equiv}0$ or 3 (mod 6), another method using difference set is presented. Furthermore, when $n{\equiv}0$ (mod 6), the decomposition obtained in this paper is ${\infty}-circular$, in the sense that it is invariant under the mapping which keeps the partite set which is indexed by ${\infty}$ fixed and permutes the remaining partite sets cyclically.

• Journal of applied mathematics & informatics
• /
• 제34권3_4호
• /
• pp.341-354
• /
• 2016

In this paper, the exact formulae for the generalized product degree distance, reciprocal product degree distance and product degree distance of tensor product of a connected graph and the complete multipartite graph with partite sets of sizes m₀, m₁, ⋯ , m_r−1 are obtained.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제27권4호
• /
• pp.171-186
• /
• 2020

Long back in 1972, it was shown that the sum of the squares of vertex degrees and the sum of cubes of vertex degrees of a molecular graph both have large correlations with total 𝜋-electron energy of the molecule. Later on, the sum of squares of vertex degrees was named as first Zagreb index and became one of the most studied molecular graph parameter in the field of chemical graph theory. Whereas, the other sum remained almost unnoticed until recently except for a few occasions. Thus it got the name "forgotten" index or F-index. This paper investigates extremal graphs with respect to F-index among the class of bicyclic graphs with n vertices and k pendant vertices, 0 ≤ k ≤ n - 4. As consequences, we obtain the bicyclic graphs with largest and smallest F-indices.

• 호남수학학술지
• /
• 제36권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$.

• 대한수학회지
• /
• 제53권3호
• /
• pp.519-532
• /
• 2016

The zero-divisor graph of a noncommutative ring R, denoted by ${\Gamma}(R)$, is a graph whose vertices are nonzero zero-divisors of R, and there is a directed edge from a vertex x to a distinct vertex y if and only if xy = 0. Let $R=M_2(F_q)$ be the $2{\times}2$ matrix ring over a finite field $F_q$. In this article, we investigate the automorphism group of ${\Gamma}(R)$.

• 대한수학회논문집
• /
• 제33권2호
• /
• pp.379-395
• /
• 2018

Assume that R is a commutative ring with non-zero identity which is not an integral domain. An ideal I of R is called an annihilating ideal if there exists a non-zero element $a{\in}R$ such that Ia = 0. S. Visweswaran and H. D. Patel associated a graph with the set of all non-zero annihilating ideals of R, denoted by ${\Omega}(R)$, as the graph with the vertex-set $A(R)^*$, the set of all non-zero annihilating ideals of R, and two distinct vertices I and J are adjacent if I + J is an annihilating ideal. In this paper, we study the relations between the diameters of ${\Omega}(R)$ and ${\Omega}(R[x])$. Also, we study the relations between the diameters of ${\Omega}(R)$ and ${\Omega}(R[[x]])$, whenever R is a Noetherian ring. In addition, we investigate the relations between the diameters of this graph and the zero-divisor graph. Moreover, we study some combinatorial properties of ${\Omega}(R)$ such as domination number and independence number. Furthermore, we study the complement of this graph.

• 대한수학회지
• /
• 제49권1호
• /
• pp.85-98
• /
• 2012

Let R be a commutative ring and I its proper ideal, let S(I) be the set of all elements of R that are not prime to I. Here we introduce and study the total graph of a commutative ring R with respect to proper ideal I, denoted by T(${\Gamma}_I(R)$). It is the (undirected) graph with all elements of R as vertices, and for distinct x, y ${\in}$ R, the vertices x and y are adjacent if and only if x + y ${\in}$ S(I). The total graph of a commutative ring, that denoted by T(${\Gamma}(R)$), is the graph where the vertices are all elements of R and where there is an undirected edge between two distinct vertices x and y if and only if x + y ${\in}$ Z(R) which is due to Anderson and Badawi [2]. In the case I = {0}, $T({\Gamma}_I(R))=T({\Gamma}(R))$; this is an important result on the definition.

• Kyungpook Mathematical Journal
• /
• 제56권3호
• /
• pp.647-655
• /
• 2016

Let H be a graph, and $k{\geq}{\chi}(H)$ an integer. We say that H has a cyclic Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings, including the last and the first, agree on all vertices of H except one. The Gray code number of H is the least integer $k_0(H)$ such that H has a cyclic Gray code of its k-colourings for all $k{\geq}k_0(H)$. For complete bipartite graphs, we prove that $k_0(K_{\ell},r)=3$ when both ${\ell}$ and r are odd, and $k_0(K_{\ell},r)=4$ otherwise.

• 대한수학회논문집
• /
• 제32권1호
• /
• pp.7-17
• /
• 2017

Let R be a commutative ring with zero-divisors Z(R). The extended zero-divisor graph of R, denoted by $\bar{\Gamma}(R)$, is the (simple) graph with vertices $Z(R)^*=Z(R){\backslash}\{0\}$, the set of nonzero zero-divisors of R, where two distinct nonzero zero-divisors x and y are adjacent whenever there exist two non-negative integers n and m such that $x^ny^m=0$ with $x^n{\neq}0$ and $y^m{\neq}0$. In this paper, we consider the extended zero-divisor graphs of idealizations $R{\ltimes}M$ (where M is an R-module). At first, we distinguish when $\bar{\Gamma}(R{\ltimes}M)$ and the classical zero-divisor graph ${\Gamma}(R{\ltimes}M)$ coincide. Various examples in this context are given. Among other things, the diameter and the girth of $\bar{\Gamma}(R{\ltimes}M)$ are also studied.

• 디지털융복합연구
• /
• 제20권2호
• /
• pp.345-351
• /
• 2022

단순 무방향 그래프 G 의 L(2,1)-coloring은 d(u,v)가 두 정점 사이의 거리일 때 두 가지 조건 (1) d(x,y) = 1 라면 |f(x)-f(y)|≥ 2, (2) d(x,y) = 2 라면 |f(x)-f(y)|≥ 1 을 만족하는 함수 f : V → [0,1,…,k]를 정의하는 것이다. 임의의 L(2,1)-coloring c 에 대하여 G 의 c-span 은 λ(c)=max{|c(u)-c(v)|| u,v∈V} 이며, L(2,1)-coloring number 인 λ(G)는 모든 가능한 c 에 대하여 λ(G) = min{λ(c)} 로 정의된다. 본 논문에서는 Harary의 정리에 기반하여 지름이 2인 그래프에 대하여 여그래프에 해밀턴 경로의 존재여부를 Tabu Search를 사용해 판단하고 이를 통해 λ(G)가 n(=|V|)과 같음을 분석한다.