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: | Savari Prabhu, Arumugam Krishnan Arulmozhi, M. Arulperumjothi |
|---|---|
| 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!
|
Similar Items
-
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01) -
Co-Secure Domination Number in Some Graphs
by: Jiatong Cui, et al.
Published: (2024-12-01) -
Mixed metric dimension and exchange property of hexagonal nano-network
by: Peide Liu, et al.
Published: (2024-11-01) -
Metric dimension of star fan graph
by: S. Prabhu, et al.
Published: (2025-01-01) -
Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
by: Şakir Işleyen
Published: (2021-02-01)