13 citations · 18 across the 4 of their papers we have counts for
4 papers
Holes and a chordal cut in a graph
Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano
A set of vertices of a graph is called a {\em clique cut} of if the subgraph of induced by is a complete graph and the number of connected components of i…
The competition number of a graph in which any two holes share at most one edge
Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano
The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D s…
The competition numbers of Hamming graphs with diameter at most three
Boram Park, Yoshio Sano
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (…
The non-bipartite integral graphs with spectral radius three
Taeyoung Chung, Jack Koolen, Yoshio Sano +1
In this paper, we classify the connected non-bipartite integral graphs with spectral radius three.