Results 21 to 30 of about 424,178 (243)
Fault Tolerant Partition Resolvability in Convex Polytopes
Convex polytopes are special types of polytopes having an additional property that they are also convex sets in the n-dimensional Euclidean space. The convex polytope topologies are being used in the antitracking networks due to their stability, resilience, and destroy-resistance.
Asim Nadeem +3 more
openaire +1 more source
On the partition dimension of trees [PDF]
10.1016/j.dam.2013.09.026Given an ordered partition ?={P1,P2,., Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v?V with respect to the partition ? is the vector r(v|?)=(d(v,P1),d(v,P2),.,d(v,Pt)), where d(v,
González Yero, I. +5 more
core +1 more source
Partition Dimension of Generalized Petersen Graph
Let G=VG,EG be the connected graph. For any vertex i∈VG and a subset B⊆VG, the distance between i and B is di;B=mindi,j|j∈B. The ordered k-partition of VG is Π=B1,B2,…,Bk. The representation of vertex i with respect to Π is the k-vector, that is, ri|Π=di,
Muhammad Azeem +3 more
core +1 more source
OPEN PROBLEMS AND CONJECTURES ON THE FACTOR IRECIPROCAL PARTITION THEORY [PDF]
On an OPEN PROBLEMS AND CONJECTURES ON THE FACTOR IRECIPROCAL PARTITION ...
Murthy, A.
core +1 more source
On the Bounded Partition Dimension of Some Generalised Graph Structures
Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Muhammad Ahsan Asim, Wajdi Alghamdi
core +1 more source
Equations resolving a conjecture of Rado on partition regularity
2 pages, no figures.
Boris Alexeev, Jacob Tsimerman
openaire +3 more sources
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 each node in the presence of faults, having promising applications in telecommunication, robot ...
Kamran Azhar +4 more
openaire +3 more sources
Quantum Barnes Function as the Partition Functionof the Resolved Conifold [PDF]
We give a short new proof of large N duality between the Chern‐Simons invariants of the 3‐sphere and the Gromov‐Witten/Donaldson‐Thomas invariants of the resolved conifold. Our strategy applies to more general situations, and it is to interpret the Gromov‐Witten, the Donaldson‐Thomas, and the Chern‐Simons invariants as different characterizations of ...
openaire +4 more sources
Phylogenomics and a posteriori data partitioning resolve the Cretaceous angiosperm radiation Malpighiales [PDF]
The angiosperm order Malpighiales includes ∼16,000 species and constitutes up to 40% of the understory tree diversity in tropical rain forests. Despite remarkable progress in angiosperm systematics during the last 20 y, relationships within Malpighiales remain poorly resolved, possibly owing to its rapid rise during the mid-Cretaceous.
Xi, Zhenxiang +10 more
openaire +2 more sources
Local Metric and Partition Resolvability of Graphs With Applications
The distance‐based graph parameters are being used extensively in the fields of chemistry, computer science, scheduling and in many operations’ management problems. The unique identification of vertices plays a key role in the computation of these parameters.
Kamran Azhar, Asim Nadeem, Yilun Shang
openaire +4 more sources

