Results 21 to 30 of about 8,525 (305)
A Boundary Class for the k-Path Partition Problem [PDF]
, 2018 We establish the first known boundary class for the k-path partition problem and deduce that for a graph class defined by finitely many minimal forbidden induced subgraphs, the k-path partition problem remains NP-hard unless one of the forbidden induced ...
Nicholas Korpelainen +1 more
core +1 more source
Aspects of Topological String Theory [PDF]
, 2008 Two aspects of the topological string and its applications are considered in this thesis. Firstly, non-perturbative contributions to the OSV conjecture relating four-dimensional extremal black holes and the closed topological string partition function ...
Cook, Paul Langabi Hogan
core +1 more source
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs [PDF]
, 2020 Let Π₁, Π₂, …, Π_c be graph properties for a fixed integer c. Then, (Π₁, Π₂, …, Π_c)-Partition is the problem of asking whether the vertex set of a given graph can be partitioned into c subsets V₁, V₂, …, V_c such that the subgraph induced by V_i ...
Ito, Takehiro, Tamura, Yuma, Zhou, Xiao
core +1 more source
Vertex Separators for Partitioning a Graph [PDF]
Sensors, 2008 Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of ...
openaire +3 more sources
On the b-Domatic Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition 𝒫 of G is called b-
Benatallah Mohammed +2 more
doaj +1 more source
Vertex colouring edge partitions
Journal of Combinatorial Theory, Series B, 2005 Suppose that the edges of a graph are assigned labels from a \(k\)-set, or equivilently, the edges are partitioned into \(k\) parts. Each vertex \(v\) has an associated multiset \(X_v\) consisting of the labels on its incident edges. The partition is a (proper) vertex coloring if for every edge \(uv\), \(X_u \neq X_v\).
Louigi Addario-Berry +3 more
openaire +2 more sources
Topological vertex for 6d SCFTs with ℤ2-twist
Journal of High Energy Physics, 2021 We compute the partition function for 6d N $$ \mathcal{N} $$ = 1 SO(2N) gauge theories compactified on a circle with ℤ2 outer automorphism twist. We perform the computation based on 5-brane webs with two O5-planes using topological vertex with two O5 ...
Hee-Cheol Kim, Minsung Kim, Sung-Soo Kim
doaj +1 more source
THE PARTITION DIMENSION AND $k$-DOMINATION NUMBER OF TWO SPECIFIC GRAPHS [PDF]
Journal of Algebraic SystemsFor an ordered $k$-partition $\Omega = \{S_1, S_2, ..., S_k\}$ of vertex set of a connected graph $G$ and a vertex $v$ of $G$, the representation of $v$ with respect to $\Omega$ is defined as the $k$-tuple $r(v |\Omega) = (d(v, S_1), d(v, S_2), ..., d(v,
Ali Zafari, Saeid Alikhani
doaj +1 more source
Instanton counting and O-vertex
Journal of High Energy Physics, 2021 We present closed-form expressions of unrefined instanton partition functions for gauge groups of type BCD as sums over Young diagrams. For SO(n) gauge groups, we provide a fivebrane web picture of our formula based on the vertex-operator formalism of ...
Satoshi Nawata, Rui-Dong Zhu
doaj +1 more source
Tree partitioning via vertex deletion
Electronic Notes in Discrete Mathematics, 2001 Abstract Motivated by tree partitioning problems, we introduce the notion of i-divider of a tree, t -dividers generalize concepts well-known in literature, such as centroids and separators, that are the backbone of tree decomposition algorithms based on vertex deletion.
FINOCCHI, Irene, PETRESCHI, Rossella
openaire +3 more sources