Results 51 to 60 of about 184,015 (290)
Variations on Graph Products and Vertex Partitions [PDF]
, 2009 In this thesis we investigate two graph products called double vertex graphs and complete double vertex graphs, and two vertex partitions called dominator partitions and rankings.
Jacob, Jobby
core +1 more source
The Partition Dimension of Daisy Graphs and Its Barbell
Science and Technology IndonesiaThe partition dimension of a graph is determined by minimum number of vertex partitions such that every vertex has different distances to the ordered partitions.
Asmiati +3 more
doaj +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Towards Yang-Baxter integrability of quantum crystal melting: From Kagome lattice to vertex models
Nuclear Physics B, 2021 This paper considers aspects of a Kagome lattice system with states classified by plane partitions. Using two sets of free fermions, we rewrite the lattice in terms of two families of spin chains.
Thiago Araujo
doaj +1 more source
The B-Domatic Number of a Graph
Discussiones Mathematicae Graph Theory, 2013 Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such ...
Favaron Odile
doaj +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
A Set Partition Analog of the Erd os-Szekeres Theorem [PDF]
, 2013 Permission to publish this work was granted by the author. The paper was submitted to the Archives on CD.The monotonic subsequence problem has been studied in depth.
Liu, Rui
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 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
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