Results 21 to 30 of about 7,733 (263)
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
IEEE Access, 2022 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 each node in the presence of faults, having promising applications in telecommunication, robot ...
Kamran Azhar +4 more
openaire +2 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Partition dimension was introduced as a part of interesting topic in graph theory. It was focus to observe about distance. The local partition dimension is an expansion of the partition dimension by adding certain conditions to the representation of the ...
Ilham Saifudin +2 more
doaj +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
IEEE Access, 2021 The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs
Ayesha Shabbir, Muhammad Azeem
doaj +1 more source
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Jurnal Matematika UNAND, 2019 Misalkan terdapat k partisi dengan himpunan terurut S = {S1, S2, ..., Sk} dari himpunan titik V (G) pada graf terhubung G = (V, E), representasi partisi v ∈ V terhadap S adalah koordinat r(v | S) dengan: r(v | S) = (d(v, S1), d(v, S2), ..., d(v, Sk ...
Muthia Muhana +2 more
doaj +1 more source
Sensors, 2022 Long range (LoRa) is one of the most successful low-power wide-area networking technologies because it is ideally suited for long-distance, low-bit rate, and low-power communications in the unlicensed sub-GHz spectrum utilized for Internet of things (IoT)
Dick Mugerwa +4 more
doaj +1 more source
PLoS ONE, 2021 What makes written text appealing? In this registered report protocol, we propose to study the linguistic characteristics of news headline success using a large-scale dataset of field experiments (A/B tests) conducted on the popular website Upworthy ...
Kristina Gligorić +3 more
doaj +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose 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 +1 more source
Black hole hair removal for N = 4 CHL models
Journal of High Energy Physics, 2021 Although BMPV black holes in flat space and in Taub-NUT space have identical near-horizon geometries, they have different indices from the microscopic analysis. For K3 compactification of type IIB theory, Sen et al.
Subhroneel Chakrabarti +4 more
doaj +1 more source