Kijung Kim

activity

20112023

most citedOn a conjecture of Brouwer involving the connectivity of strongly regular graphs

15 citations · 19 across the 15 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

Perfect Roman domination in middle graphs

Kijung Kim

The middle graph $M (G)$ of a graph $G$ is the graph obtained by subdividing each edge of $G$ exactly once and joining all these newly introduced vertices of adjacent edges of $G$ .…

math.CO2021

Restrained Italian domination in trees

Kijung Kim

Let $G = (V, E)$ be a graph. A subset $D$ of $V$ is a \textit{restrained dominating set} if every vertex in $V ∖ D$ is adjacent to a vertex in $D$ and to a vertex in $V \setmi…