Results 41 to 50 of about 295,471 (297)
A Note on Non-Dominating Set Partitions in Graphs
Discussiones Mathematicae Graph Theory, 2016 A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S.
Desormeaux Wyatt J. +2 more
doaj +1 more source
DONALDSON–THOMAS INVARIANTS OF LOCAL ELLIPTIC SURFACES VIA THE TOPOLOGICAL VERTEX
Forum of Mathematics, Sigma, 2019 We compute the Donaldson–Thomas invariants of a local elliptic surface with section. We introduce a new computational technique which is a mixture of motivic and toric methods. This allows us to write the partition function for the invariants in terms of
JIM BRYAN, MARTIJN KOOL
doaj +1 more source
Partition dimension of trees - palm approach
Electronic Journal of Graph Theory and ApplicationsThe partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition.
Yusuf Hafidh, Edy Tri Baskoro
doaj +1 more source
Lattice models, cylinder partition functions, and the affine coxeter element [PDF]
, 1998 The partition functions of the affine Pasquier models on the cylinder are calculated in the continuum limit. The partition functions of the models based upon the Â(_n) cycle graphs are first found from the appropriate Coulomb-gas equivalence.
Talbot, Robert Paul Thomas
core
Advanced Engineering Materials, EarlyView.Scandium (Sc)‐doped AlCoCrFeMo HEA coatings are fabricated via flame spraying with 0.1, 0.3, and 0.5 wt% Sc additions. Among these, the HEA‐Sc0.3 coating exhibits the highest corrosion resistance, indicated by a more positive corrosion potential and lower current density.
Pankaj Kumar +7 more
wiley +1 more source
On some families of arbitrarily vertex decomposable spiders [PDF]
Opuscula Mathematica, 2010 A graph \(G\) of order \(n\) is called arbitrarily vertex decomposable if for each sequence \((n_1, ..., n_k)\) of positive integers such that \(\sum _{i=1}^{k} n_i = n\), there exists a partition \((V_1, ..., V_k)\) of the vertex set of \(G\) such that
Tomasz Juszczyk, Irmina A. Zioło
doaj +1 more source
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
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Embedding the dual complex of hyper-rectangular partitions
Journal of Computational Geometry, 2013 A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a nice drawing of its dual, that is, a straight-line embedding of it such that each dual vertex is ...
Michael Kerber
doaj +1 more source
Automorphisms and twisted vertex operators [PDF]
, 1987 This work is an examination of various aspects of twisted vertex operator representations of Kac-Moody algebras. It starts with an introduction to Kac-Moody algebras and string theories, including a discussion of the propagation of strings on orbifolds ...
Myhill, R.G, Myhill, Richard Graham
core