Results 81 to 90 of about 344,286 (183)
Topological open/closed string dualities: matrix models and wave functions
We sharpen the duality between open and closed topological string partition functions for topological gravity coupled to matter. The closed string partition function is a generalized Kontsevich matrix model in the large dimension limit.
Sujay K. Ashok, Jan Troost
doaj +1 more source
Trees with Certain Locating-chromatic Number
The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
Semi-pointed partition posets and Species
We define semi-pointed partition posets, which are a generalisation of partition posets and show that they are Cohen-Macaulay. We then use multichains to compute the dimension and the character for the action of the symmetric groups on their homology. We
Delcroix-Oger, Bérénice
core +1 more source
Fault-tolerant partition resolvability of cycle with chord.
In the realm of connected networks, distance-based parameters, particularly the partition dimension of graphs, have extensive applications across various fields, including chemistry and computer science.
Kamran Azhar +3 more
doaj +1 more source
Adaptive Clustering through Semidefinite Programming
We analyze the clustering problem through a flexible probabilistic model that aims to identify an optimal partition on the sample X 1 , ..., X n. We perform exact clustering with high probability using a convex semidefinite estimator that interprets as a
Royer, Martin
core
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 +1 more source
All Graphs of Order n with Distinguishing Number n−1 or n − 2
Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism.
Andi Pujo Rahadi +2 more
doaj +1 more source
Two-dimensional interpolation using a cell-based searching procedure
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant.
Cavoretto, Roberto
core
On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph
A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of .
Jalal Hatem Hussein Bayati +3 more
doaj +1 more source
In the aircraft sector, honeycomb composite materials are frequently employed. Recent research has demonstrated the benefits of honeycomb structures in applications involving nanohole arrays in anodized alumina, micro-porous arrays in polymer thin films,
Sidra Bukhari +3 more
doaj +1 more source

