Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
AIMS Mathematics<abstract><p>Let $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $ G $. A $ k $-ordered partition of vertices of $ G $ is represented as $ {R}{p} =
Ali N. A. Koam +3 more
openaire +4 more sources
Refined dual stable Grothendieck polynomials and generalized Bender-Knuth involutions [PDF]
, 2015 The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and we prove that
Galashin, Pavel +2 more
core +3 more sources
Simulating the Greenland ice sheet under present-day and palaeo constraints including a new discharge parameterization [PDF]
The Cryosphere, 2015 In this paper, we propose a new sub-grid scale parameterization for the ice discharge into the ocean through outlet glaciers and inspect the role of different observational and palaeo constraints for the choice of an optimal set of model parameters. This
R. Calov +3 more
doaj +1 more source
Resolving Combinatorial Ambiguities in Dilepton $t\bar t$ Event Topologies with Constrained $M_2$ Variables [PDF]
, 2017 We advocate the use of on-shell constrained $M_2$ variables in order to mitigate the combinatorial problem in SUSY-like events with two invisible particles at the LHC. We show that in comparison to other approaches in the literature, the constrained $M_2$
Debnath, Dipsikha +4 more
core +2 more sources
Coloring, location and domination of corona graphs [PDF]
, 2012 A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a ...
Aguilar, A. Rondón +2 more
core +4 more sources
On The Partition Dimension of Disconnected Graphs
Journal of Mathematical and Fundamental Sciences, 2017 For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni +2 more
doaj +1 more source
A Note on (0,2) Models on Calabi-Yau Complete Intersections [PDF]
, 1998 In the class of (0,2) heterotic compactifications which has been constructed in the framework of gauged linear sigma models the Calabi-Yau varieties X are realized as complete intersections of hypersurfaces in toric varieties IP and the corresponding ...
Aspinwall +13 more
core +2 more sources
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
The quantization of the chiral Schwinger model based on the BFT-BFV formalism II [PDF]
, 1998 We apply an improved version of Batalin-Fradkin-Tyutin (BFT) Hamiltonian method to the a=1 chiral Schwinger Model, which is much more nontrivial than the a>1.$ one.
Banerjee R +16 more
core +3 more sources
Dimensi Metrik Graf Kr+mKsr, m, r, s, En
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2011 The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj +1 more source