Results 21 to 30 of about 1,385,528 (273)
The Partition Dimension of Some Families of Trees
AbstractIn 1998, Chartrand, E. Salehi and P. Zhang introduced the concept of graph partition dimension. This is a variant of graph metric dimension concept introduced independently by Slater in 1975 and Harary & Melter in 1976. In this paper, we determine the partition dimension of specific classes of trees, namely homogeneous caterpillars and ...
Edy Tri Baskoro
exaly +2 more sources
On the Partition Dimension of a Class of Circulant Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen +2 more
exaly +4 more sources
Discrepancies Between Metric Dimension and Partition Dimension of a Connected Graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioan Tomescu
exaly +2 more sources
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2 [PDF]
Suppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +2 more sources
On the Constant Partition Dimension of Some Generalized Families of Toeplitz Graph
The use of graph theory is prevalent in the field of network design, whereby it finds utility in several domains such as the development of integrated circuits, communication networks, and transportation systems. The comprehension of partition dimensions
Ali N. A. Koam +4 more
doaj +2 more sources
Brick partition problems in three dimensions [PDF]
A $d$-dimensional brick is a set $I_1\times \cdots \times I_d$ where each $I_i$ is an interval. Given a brick $B$, a brick partition of $B$ is a partition of $B$ into bricks. A brick partition $\mathcal{P}_d$ of a $d$-dimensional brick is $k$-piercing if every axis-parallel line intersects at least $k$ bricks in $\mathcal{P}_d$. Bucic et al. explicitly
Ilkyoo Choi, Minseong Kim, Kiwon Seo
openaire +2 more sources
The Metric Dimension of Wheel Graph Wn & Partition Dimension of Graph Ks + Kt
In this paper, we determine and show the proof of the metric dimension of a wheel graph and the partition dimension of graph F = Ks + Kt. The solution for the metric dimension is divided into four cases. If n = 3 or 6, the metric dimension of wheel graph
Dito, Samuel Benny +4 more
core +2 more sources
The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs
The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks.
Kamran Azhar +4 more
doaj +1 more source
Fault-Tolerant Partition Resolvability of Cyclic Networks
Graph invariants provide an amazing tool to analyze the abstract structures of networks. The interaction and interconnection between devices, sensors, and service providers have opened the door for an eruption of mobile over the web applications ...
Kamran Azhar +3 more
doaj +1 more source
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify ...
Kamran Azhar +4 more
doaj +1 more source

