87 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Pohang University of Science and TechnologyKR6 papers
- Dongguk UniversityKR5 papers
- Seoul National UniversityKR5 papers
- Korea Advanced Institute of Science and TechnologyKR4 papers
- Yeungnam UniversityKR4 papers
- The University of SydneyAU3 papers
- Tohoku UniversityJP3 papers
- Université Libre de BruxellesBE3 papers
- University of Electro-CommunicationsJP3 papers
- Utah State UniversityUS3 papers
- Yonsei UniversityKR3 papers
- Carleton UniversityCA2 papers
5 papers · 1 filter
A proper total coloring distinguishing adjacent vertices by sums of some product graphs
Hana Choi, Dongseok Kim, Sungjin Lee +1
In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges inciden…
The distinguishing numbers of merged Johnson graphs
Dongseok Kim, Young Soo Kwon, Jaeun Lee
In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.
On the existence problem of the total domination vertex critical graphs
Moo Young Sohn, Dongseok Kim, Young Soo Kwon +1
The existence problem of the total domination vertex critical graphs has been studied in a series of articles. The aim of the present article is twofold. First, we settle the exist…
The weighted complexity and the determinant functions of graphs
Dongseok Kim, Young Soo Kwon, Jaeun Lee
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a po…
Generalized characteristic polynomials of graph bundles
Dongseok Kim, Hye Kyung Kim, Jaeun Lee
In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial deriv…