ホーム > 佐野良夫/ Sano, Yoshio

佐野良夫

Sano, Yoshio

システム情報系 , 准教授
Faculty of Engineering, Information and Systems , Associate Professor

http://syou.cs.tsukuba.ac.jp/sano/index.html

オープンアクセス版の論文は「つくばリポジトリ」で読むことができます。

21. Fat Hoffman graphs with smallest eigenvalue at least -2.481194304092... Yoshio SANO
Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications 417 (2015)
22. The double competition multigraph of a digraph Jeongmi PARK; Yoshio SANO
Discrete Mathematics & Theoretical Computer Science 17: 303 (2015)
23. On the smallest eigenvalues of the line graphs of some trees Akihiro MUNEMASA; Yoshio SANO; Tetsuji TANIGUCHI
Linear Algebra and its Applications 466: 501 (2015) Semantic Scholar
24. A generalization of Opsut's result on the competition numbers of line graphs Suh-Ryung KIM; Jung Yeun LEE; Boram PARK; Yoshio SANO
Discrete Applied Mathematics 181: 152 (2015)
25. Edge-signed graphs with smallest eigenvalue greater than -2 Gary GREAVES; Jack KOOLEN; Akihiro MUNEMASA; Yoshio SANOTetsuji TANIGUCHI
Journal of Combinatorial Theory, Series B 110: 90 (2015) Semantic Scholar
26. Travel groupoids on infinite graphs Jung Rae CHO; Jeongmi PARK; Yoshio SANO
Czechoslovak Mathematical Journal 64: 763 (2014) Semantic Scholar
27. The double multicompetition number of a multigraph Jeongmi PARK; Yoshio SANO
Lecture Notes in Computer Science 8845: 138 (2014) Semantic Scholar
28. The competition hypergraphs of doubly partial orders Suh-Ryung KIM; Jung Yeun LEE; Boram PARK; Yoshio SANO
Discrete Applied Mathematics 165: 185 (2014) Semantic Scholar
29. Fat Hoffman graphs with smallest eigenvalue at least $-1- au$ Akihiro MUNEMASA; Yoshio SANO; Tetsuji TANIGUCHI
Ars Mathematica Contemporanea 7: 247 (2014)
30. The non-confusing travel groupoids on a finite connected graph Jung Rae CHO; Jeongmi PARK; Yoshio SANO
Lecture Notes in Computer Science 8845: 14 (2014) Semantic Scholar
31. Fat Hoffman graphs with smallest eigenvalue greater than -3 Akihiro MUNEMASA; Yoshio SANO; Tetsuji TANIGUCHI
Discrete Applied Mathematics 176: 78 (2014) Semantic Scholar
32. The niche graphs of interval orders Jeongmi PARK; Yoshio SANO
Discussiones Mathematicae Graph Theory 34: 353 (2014) Semantic Scholar
33. Competitively tight graphs Suh-Ryung KIM; Jung Yeun LEE; Boram PARK; Yoshio SANO
Annals of Combinatorics 17: 733 (2013) Semantic Scholar
34. A generalization of Opsut's lower bounds for the competition number of a graph Yoshio SANO
Graphs and Combinatorics 29: 1543 (2013) Semantic Scholar
35. The competition number of the complement of a cycle Suh-Ryung KIM; Boram PARK; Yoshio SANO
Discrete Applied Mathematics Vol. 161: 1755 (2013) Semantic Scholar
36. The phylogeny graphs of doubly partial orders Boram PARK; Yoshio SANO
Discussiones Mathematicae Graph Theory 33: 657 (2013) Semantic Scholar
37. Edge-disjoint decompositions of complete multipartite graphs into gregarious long cycles Jung Rae CHO; Jeongmi PARK; Yoshio SANO
Lecture Notes in Computer Science 8296: 57 (2013) Semantic Scholar
38. The (1,2)-step competition number of a graph Kim A; S. FACTOR; Sarah K. MERZ; Yoshio SANO
Congressus Numerantium 215: 153 (2013)
39. Graph equation for line graphs and $m$-step graphs Seog-Jin KIM; Suh-Ryung KIM; Jung Yeun LEE; Won Jin PARKYoshio SANO
Graphs and Combinatorics 28: 831 (2012) Semantic Scholar
40. The competition numbers of complete multipartite graphs with many partite sets Suh-Ryung KIM; Boram PARK; Yoshio SANO
Discrete Applied Mathematics Vol. 160: 1176 (2012) Semantic Scholar