J. Song

most citedOn certain hyperplane arrangements and colored graphs

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2017

Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory

Joungmin Song

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

math.CO2017

Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $J_{n}$

Joungmin Song

We give a complete formula for the characteristic polynomial of hyperplane arrangements $J_{n}$ consisting of the hyperplanes $x_{i} + x_{j} = 1$ , $x_{k} = 0$ , $x_{l} = 1$ , $ 1\leq i, j, k,…

math.CO2016★ 1 cited

Enumeration of graphs with given weighted number of connected components

Joungmin Song

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generati…

math.CO2016★ 2 cited

On certain hyperplane arrangements and colored graphs

Joungmin Song

We exhibit a one-to-one correspondence between $3$ -colored graphs and subarrangements of certain hyperplane arrangements denoted $J_{n}$ , $n \in N$ . We define the no…

Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory

Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements Jn​

Enumeration of graphs with given weighted number of connected components

On certain hyperplane arrangements and colored graphs

Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $J_{n}$