26 citations · 161 across the 33 of their papers we have counts for
5 papers · 2 filters
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.
The competition-common enemy graphs of digraphs satisfying Conditions and
Yoshio Sano
S. -R. Kim and F. S. Roberts (2002) introduced the following conditions and for digraphs as generalizations of the condition for digraphs to be semiorders. The condi…
The competition numbers of ternary Hamming graphs
Boram Park, Yoshio Sano
It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano [13] gave the exact values of the competition numbers of Hamming grap…
On the hypercompetition numbers of hypergraphs
Boram Park, Yoshio Sano
The competition hypergraph $C{\cH}(D)$ of a digraph is the hypergraph such that the vertex set is the same as and is a hyperedge if and only if conta…