Zobrazeno 1 - 10
of 17 242
pro vyhledávání: '"polytope"'
Autor:
Ali N. A. Koam
Publikováno v:
AIMS Mathematics, Vol 9, Iss 4, Pp 9911-9925 (2024)
If a subset of vertices of a graph, designed in such a way that the remaining vertices have unique identification (usually called representations) with respect to the selected subset, then this subset is named as a metric basis (or resolving set). Th
Externí odkaz:
https://doaj.org/article/cc15dfcb5e6e4e51b941570122cf7fa5
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:
Special Matrices, Vol 12, Iss 1, Pp 635-655 (2024)
The geometry of the compact convex set of all n×nn\times n doubly stochastic matrices, a structure frequently referred to as the Birkhoff polytope, has been an active subject of research as of late. Geometric characteristics such as the Chebyshev ce
Externí odkaz:
https://doaj.org/article/52d90300187d4022b0baaa52ce2abb81
Publikováno v:
Symmetry, Vol 16, Iss 9, p 1246 (2024)
This paper addresses the problem of computing the optimal stacking of two monotone polytopes P and Q in Rd. A monotone polytope in Rd is defined as a polytope whose intersection with any line parallel to the last coordinate axis xd is connected, and
Externí odkaz:
https://doaj.org/article/d3c8c81dbec448d6bd149920d5b0dacc
Publikováno v:
Heliyon, Vol 10, Iss 8, Pp e29304- (2024)
A convex hull of finitely many points in the Euclidean space Rd is known as a convex polytope. Graphically, they are planar graphs i.e. embeddable on R2. Minimum dominating sets possess diverse applications in computer science and engineering. Locati
Externí odkaz:
https://doaj.org/article/9cc7424f20b14c38ae55f3f2a54ccba7