Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks
Networks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Fractal and Fractional |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-3110/8/12/747 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Networks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>Q</mi><mi>n</mi></msup></semantics></math></inline-formula>. In a recent study, the hypercube networks were insufficient to hold supercomputers’ parallel processors. Thus, variants of hypercubes were discovered to produce an alternative to the hypercube. A new variant of the hypercube, the <i>fractal cubic network</i>, can be used as the best alternative in the case of hypercubes. Our research investigates that the fractal cubic network is a <i>rooted product</i> of two graphs. We try to determine its domination and resolving domination parameters, which could be applied to resource location and broadcasting-related problems. |
|---|---|
| ISSN: | 2504-3110 |