An efficient representation of Benes networks and its applications
From MaRDI portal
Publication:954947
DOI10.1016/j.jda.2006.08.003zbMath1159.05307OpenAlexW2067587105MaRDI QIDQ954947
Indra Rajasingh, Mostafa I. Abd-El-Barr, Bharathi Rajan, Paul D. Manuel
Publication date: 18 November 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.08.003
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (23)
On some degree-based irregularity indices of certain networks ⋮ On topological indices of certain interconnection networks ⋮ On the metric dimension of circulant and Harary graphs ⋮ Resolving-power dominating sets ⋮ Metric dimension of directed graphs ⋮ On topological properties of Sierpinski networks ⋮ Computing topological indices of sudoku graphs ⋮ On topological properties of hierarchical interconnection networks ⋮ Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks ⋮ Embedding Circulant Networks into Butterfly and Benes Networks ⋮ Metric Dimension for Amalgamations of Graphs ⋮ On excessive index of certain networks ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ On topological indices of fullerenes ⋮ On topological indices for new classes of Benes network ⋮ On topological properties of poly honeycomb networks ⋮ An efficient representation of Benes networks and its applications ⋮ Conditional resolvability of honeycomb and hexagonal networks ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ On the isometric path partition problem ⋮ On degree-based topological indices of symmetric chemical structures
Cites Work
This page was built for publication: An efficient representation of Benes networks and its applications