Zobrazeno 1 - 10
of 879
pro vyhledávání: '"Resolving set"'
Autor:
Peide Liu, Sikander Ali, Muhammad Azeem, Muhammad Kamran Jamil, Manzoor Ahmad Zahid, Waleed Ali, Bandar Almohsen
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-11 (2024)
Abstract The mixed metric dimension of a graph is an important parameter in characterizing its structural complexity, specifically in nanoscale networks where precision is paramount. In this article, we calculate the mixed metric dimension of hexagon
Externí odkaz:
https://doaj.org/article/582bc927432e40de9aab9b1fe7cc1e0a
Publikováno v:
IEEE Access, Vol 12, Pp 12199-12208 (2024)
The notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are repre
Externí odkaz:
https://doaj.org/article/d58bc90d1e614a91967f05a7a6947fc3
Autor:
Muhammad Umer Farooq, Muhammad Hussain, Ahmed Zubair Jan, Afraz Hussain Mjaeed, Mirwais Sediqma, Ayesha Amjad
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-11 (2024)
Abstract In the modern digital sphere, graph theory is a significant field of research that has a great deal of significance. It finds widespread application in computer science, robotic directions, and chemistry. Additionally, graph theory is used i
Externí odkaz:
https://doaj.org/article/46d1bd62421446b1a2d067a9e9d96c8d
Publikováno v:
Heliyon, Vol 10, Iss 13, Pp e33211- (2024)
The practical and theoretical significance of the resolvability parameter makes it an important factor, particularly in the context of network analysis. Its significance is seen in various applications and consequences: Network security, efficient ro
Externí odkaz:
https://doaj.org/article/88877d6b561d40a8aa2e95bdca78f7cd
Publikováno v:
AIMS Mathematics, Vol 9, Iss 4, Pp 10078-10094 (2024)
Let $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $
Externí odkaz:
https://doaj.org/article/7ddc8fe557194a73ad1799b6b0869bb6
Publikováno v:
AIMS Mathematics, Vol 9, Iss 4, Pp 9435-9446 (2024)
Let $ G $ be a connected graph of order $ n $. The representation of a vertex $ v $ of $ G $ with respect to an ordered set $ W = \{w_1, w_2, ..., w_k\} $ is the $ k $-vector $ r(v|W) = (d(v, w_1), d(v, w_2), ..., d(v, w_k)) $, where $ d(v, w_i) $ re
Externí odkaz:
https://doaj.org/article/65e9c619b2bd48958772f5fda3fe9738
Publikováno v:
IEEE Access, Vol 12, Pp 23751-23757 (2024)
In the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin fi
Externí odkaz:
https://doaj.org/article/538b6a47841645a483640f7c8916d024