Results 41 to 50 of about 344,286 (183)
Partition Dimension of Dutch Windmill Graph
Jurnal Matematika, Statistika dan Komputasi, 2021 Let be a connected graph G and -partition of end . The coordinat to is definition . If every twovertex is distinct applies, then is a called partition of . The minimum k for which k-resolving partition of is the partition dimension and denoted with . In this paper, we investigates the partition dimensionfor a large Dutch windmill graph for and
Hasmawati Hasmawati +3 more
openaire +2 more sources
The Mixed Partition Dimension: A New Resolvability Parameter in Graph Theory
IEEE AccessIn this article, we introduce a novel graph-theoretical parameter called the mixed partition dimension and apply it to the path graph and the hexagonal network.
Siti Norziahidayu Amzee Zamri +4 more
doaj +1 more source
On Sharp Bounds on Partition Dimension of Convex Polytopes
IEEE Access, 2020 Let $\Omega $ be a connected graph and for a given $l$ -ordered partition of vertices of a connected graph $\Omega $ is represented as $\beta =\{\beta _{1},\beta _{2}, {\dots },\beta _{l}\}$ . The representation of a vertex $\mu \in V(\Omega)$ is
Yu-Ming Chu +3 more
doaj +1 more source
Approximating Tverberg Points in Linear Time for Any Fixed Dimension
, 2020 Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection.
B Chazelle +12 more
core +1 more source
Measurable circle squaring [PDF]
, 2016 Laczkovich proved that if bounded subsets $A$ and $B$ of $R^k$ have the same non-zero Lebesgue measure and the box dimension of the boundary of each set is less than $k$, then there is a partition of $A$ into finitely many parts that can be translated to
Grabowski, Łukasz +2 more
core +2 more sources
On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
Scientific Annals of Computer ScienceGraph theory is a fundamental and powerful tool for designing and modeling networks. It plays a vital role in diverse real-world systems, including social, computer, biological, ecological, and neural networks.
Kamran Azhar, Asim Nadeem, Yilun Shang
doaj +1 more source
ON PROPERTIES OF PRIME IDEAL GRAPHS OF COMMUTATIVE RINGS
Barekeng, 2023 The prime ideal graph of in a finite commutative ring with unity, denoted by , is a graph with elements of as its vertices and two elements in are adjacent if their product is in . In this paper, we explore some interesting properties of .
Rian Kurnia +5 more
doaj +1 more source
Critical temperatures of the Ising model on Sierpiñski fractal lattices [PDF]
EPJ Web of Conferences, 2020 We report our latest results of the spectra and critical temperatures of the partition function of the Ising model on deterministic Sierpiñski carpets in a wide range of fractal dimensions. Several examples of spectra are given.
Perreau Michel
doaj +1 more source
Canonical forms for matrices of Saletan contractions
, 2015 We show that each Saletan (linear) contraction can be realized, up to change of bases of the initial and the target Lie algebras, by a matrix-function that is completely defined by a partition of the dimension of Fitting component of its value at the ...
Popovych, Dmytro R.
core +1 more source
Partition dimension of trees - palm approach
Electronic Journal of Graph Theory and ApplicationsSummary: The partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition. This reduces the problem of the partition dimension of trees into finding the partition dimension
Hafidh, Yusuf, Baskoro, Edy Tri
openaire +2 more sources