26 citations · 161 across the 33 of their papers we have counts for
34 papers
Every cubic graph has four total dominating sets covering each vertex at most twice
Hyemin Kwon, Boram Park, Yoshio Sano
In 2018, Goddard and Henning conjectured that every cubic graph has four total dominating sets covering each vertex at most twice, and asked the analogous question for transversals…
On non-bipartite graphs with integral signless Laplacian eigenvalues at most 6
Semin Oh, Jeong Rye Park, Jongyook Park +1
In this paper, we completely classify the connected non-bipartite graphs with integral signless Laplacian eigenvalues at most 6.
Signed analogue of line graphs and their smallest eigenvalues
Alexander L. Gavrilyuk, Akihiro Munemasa, Yoshio Sano +1
In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than and large enough minimum degree is switching equivalent to a complete g…
On the phylogeny graphs of degree-bounded digraphs
Seung Chul Lee, Jihoon Choi, Suh-Ryung Kim +1
Hefner [K. A. S. Hefner, K. F. Jones, S. -R. Kim, R. J. Lundgren and F. S. Roberts: competition graphs, Discrete Applied Mathematics, 32, (1991) 241-262] characterized acyc…
On the partial order competition dimensions of chordal graphs
Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee +1
Choi {\it et al.} [{J.~Choi, K.~S.~Kim, S.~-R.~Kim, J.~Y.~Lee, and Y.~Sano}: {On the competition graphs of -partial orders}, \emph{Discrete Applied Mathematics} (2015), \texttt{…
T-partition systems and travel groupoids on a graph
Jung Rae Cho, Jeongmi Park, Yoshio Sano
The notion of travel groupoids was introduced by L. Nebeský in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set and a binary operation $…