|
Search the dblp DataBase
Yukio Shibata:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yosuke Kikuchi, Shingo Osawa, Yukio Shibata
Broadcasting in Generalized de Bruijn Digraphs. [Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:200-209 [Conf]
- Yosuke Kikuchi, Yukio Shibata
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs. [Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:400-408 [Conf]
- Yosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata
How to Obtain the Complete List of Caterpillars (Extended Abstract). [Citation Graph (0, 0)][DBLP] COCOON, 2003, pp:329-338 [Conf]
- Toru Araki, Masayuki Kogure, Yukio Shibata
Combinatorial properties of the divisibilty of mn by am + bn + c. [Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:64, n:, pp:3-0 [Journal]
- Toru Araki, Yukio Shibata
Isomorphic factorization of complete bipartite graph into forest. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:53, n:, pp:- [Journal]
- Toru Hasunuma, Yukio Shibata
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:103-116 [Journal]
- Yuuki Tanaka, Yukio Shibata
On the pagenumber of trivalent Cayley graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:8, pp:1279-1292 [Journal]
- Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata
On the number of cycles in generalized Kautz digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:285, n:1-3, pp:127-140 [Journal]
- Yukio Shibata, Toru Hasunuma, Sanae Fukuda
Isomorphic factorization of de Bruijn digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:218, n:1-3, pp:199-208 [Journal]
- Toru Araki, Yukio Shibata
Pancyclicity of recursive circulant graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:4, pp:187-190 [Journal]
- Tom Araki, Yukio Shibata
Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190]. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:3, pp:173- [Journal]
- Toru Hasunuma, Yukio Shibata
Containment of Butterflies in Networks Constructed by the Line Digraph Operation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:25-30 [Journal]
- Hiroyuki Kawai, Naohiro Fujikake, Yukio Shibata
Factorization of de Bruijn digraphs by cycle-rooted trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:77, n:5-6, pp:269-275 [Journal]
- Yosuke Kikuchi, Yukio Shibata
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:2, pp:79-85 [Journal]
- Yukio Shibata, Miyuki Shirahata, Shingo Osawa
Counting Closed Walks in Generalized de Bruijn Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:3, pp:135-138 [Journal]
- Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata
Isomorphic factorization, the Kronecker product and the line digraph. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:2, pp:72-77 [Journal]
- Yoshihide Igarashi, Shingo Osawa, Yukio Shibata
Some language families generated by one-letter languages. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1992, v:62, n:3, pp:271-276 [Journal]
- Yukio Shibata
On the Structure of Abelian Automata. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1976, v:13, n:2, pp:143-152 [Journal]
- Toru Hasunuma, Yukio Shibata
Counting small cycles in generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:1, pp:39-47 [Journal]
- Toru Araki, Yukio Shibata
(t, k)-Diagnosable System: A Generalization of the PMC Models. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 2003, v:52, n:7, pp:971-975 [Journal]
Broadcasting Multiple Messages Using Cycle-Rooted Trees. [Citation Graph (, )][DBLP]
Bipancyclic properties of Cayley graphs generated by transpositions. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|