Exponentiation of graphs

DOI10.1007/S11786-025-00609-1MaRDI QIDQ6969215zbMATH OpenFDO

Authors Toru Hasunuma

Publication date 23 June 2025

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11786-025-00609-1

zbMATH Keywords

exponential graphsgraph operationslogarithmic diametermaximally connectednessmulti-exponential-scale networkssuper edge-connectedness

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An efficient algorithm to construct disjoint path covers of DCell networks
• Completely independent spanning trees in line graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• Component connectivity of the data center network dcell
• Connectivity of Cartesian products of graphs
• Constructing dual-CISTs of DCell data center networks
• Constructing dual-CISTs of folded divide-and-swap cubes
• Fault-tolerant embedding of paths in crossed cubes
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3192675 (Why is no real title available?)
• On super edge-connectivity of Cartesian product graphs
• On the Cube of a Graph
• Optimal fault-tolerant embedding of paths in twisted cubes
• Some Theorems on Abstract Graphs
• Structural properties of subdivided-line graphs
• Super edge-connectivity and matching preclusion of data center networks
• Super-connectivity and super-edge-connectivity for some interconnection networks
• The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
• The Mobius cubes
• The restricted h-connectivity of the data center network DCell
• The square of a block is Hamiltonian connected

This page was built for publication: Exponentiation of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969215)