Toru Hasunuma

Learn More
We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs. From the results, we can obtain independent spanning trees with small depths in de Bruijn and Kautz digraphs that improve the previously known upper(More)
Let T1,T2, . . . ,Tk be spanning trees in a graph G. If for any two vertices u,v in G, the paths from u to v in T1,T2, . . . ,Tk are pairwise internally disjoint, then T1,T2, . . . ,Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault-tolerant communication problems in interconnection networks. In(More)
To investigate the mechanism of persistent proliferation of rheumatoid arthritis (RA) synoviocytes in situ, we examined the activity of telomerase enzyme and the expression of telomerase related factors in cultured synoviocytes. Cultured synoviocytes obtained from patients with rheumatoid arthritis (n=29), osteoarthritis (OA, n=18), and traumatic joint(More)