Name
Abstract | ||
|---|---|---|
In this paper we solve the edge isoperimetric problem for circulant networks and consider the problem of embedding circulant networks into various graphs such as arbitrary trees, cycles, certain multicyclic graphs and ladders to yield the minimum wirelength. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10878-011-9443-x | J. Comb. Optim. |
Keywords | Field | DocType |
Circulant networks,Multicyclic graphs,Embedding,Congestion,Wirelength | Discrete mathematics,Graph,Combinatorics,Embedding,Circulant matrix,Isoperimetric inequality,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 1 | 1382-6905 |
Citations | PageRank | References |
5 | 0.41 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Indra Rajasingh | 1 | 193 | 24.17 |
| Paul Manuel | 2 | 221 | 17.42 |
| Micheal Arockiaraj | 3 | 58 | 8.88 |
| Bharati Rajan | 4 | 135 | 12.91 |