On embedding of m-sequential k-ary trees into hypercubes

HIGHLIGHTS

• who: Indra Rajasingh and collaborators from the Department of, Loyola College, Chennai, India have published the research: On Embedding of m-Sequential k-ary Trees into Hypercubes, in the Journal: (JOURNAL) of 28/08/1998
• what: In this paper, we have obtained an embedding algorithm to embed an m-sequential k-ary tree into its optimal hypercube with dilation at most 2.

SUMMARY

The dilation of an embedding f of G into H is given by   dil  f =max Pf  f  u , f  v  :  u, v   E  G  where Pf  f . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or E-mail:

If you don't have an account, you can create one here.