Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Walaa A. Aboamer"'
Publikováno v:
Journal of Mathematics, Vol 2024 (2024)
One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building
Externí odkaz:
https://doaj.org/article/2b9f82f490c94901b0019e29fcf0680d
Publikováno v:
Computation, Vol 11, Iss 8, p 162 (2023)
The complexity (number of spanning trees) in a finite graph Γ (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most
Externí odkaz:
https://doaj.org/article/53ad7f2192c24c82b3eaa1ed5bc85267
Publikováno v:
IEEE Access, Vol 9, Pp 56736-56756 (2021)
There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the
Externí odkaz:
https://doaj.org/article/c52e333693b9421cb880a787a2968b09
Publikováno v:
IEEE Access, Vol 9, Pp 56736-56756 (2021)
There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1700587ed8506e6effc67173defe9299
https://ieeexplore.ieee.org/document/9353480/
https://ieeexplore.ieee.org/document/9353480/
Publikováno v:
Frontiers in Scientific Research and Technology.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f5489dd9c7ceedbf3eb4802814b6e47
https://doi.org/10.21608/fsrt.2021.98864.1049
https://doi.org/10.21608/fsrt.2021.98864.1049