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)

A k-fault-tolerant gossip graph is a (multiple) graph whose edges are linearly ordered such that for any ordered pair of vertices u and v, there are k + 1 edge-disjoint ascending paths from u to v. Let Ï„(n, k) denote the minimum number of edges in a k-fault-tolerant gossip graph with n vertices. In this paper, we present upper and lower bounds on Ï„(n, k)â€¦ (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)