Results 41 to 50 of about 8,525 (305)

The Locating Chromatic Number of Book Graph

open access: yesJournal of Mathematics, 2021
Let G=VG,EG be a connected graph and c:VG⟶1,2,…,k be a proper k-coloring of G. Let Π be a partition of vertices of G induced by the coloring c. We define the color code cΠv of a vertex v∈VG as an ordered k-tuple that contains the distance between each ...
Nur Inayah   +2 more
doaj   +1 more source

Lattice models, cylinder partition functions, and the affine coxeter element [PDF]

open access: yes, 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  

Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading

open access: yesAdvanced Engineering Materials, EarlyView.
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley   +1 more source

Embedding the dual complex of hyper-rectangular partitions

open access: yesJournal 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

Introduction to coalitions in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
A coalition in a graph consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G of order is a vertex partition such that every set Vi of π either is ...
Teresa W. Haynes   +4 more
doaj   +1 more source

Electrochemical Behavior of Flame‐Sprayed Sc‐Doped AlCoCrFeMo High‐Entropy Alloy Coatings in 3.5% Sodium Chloride Solution

open access: yesAdvanced 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

Web construction of ABCDEFG and affine quiver gauge theories

open access: yesJournal of High Energy Physics, 2019
The topological vertex formalism for 5d N $$ \mathcal{N} $$ = 1 gauge theories is not only a convenient tool to compute the instanton partition function of these theories, but it is also accompanied by a nice algebraic structure that reveals various ...
Taro Kimura, Rui-Dong Zhu
doaj   +1 more source

On Vertex Partitions of Hypercubes by Isometric Trees [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2011
When $n=2^m-1$ M.Ramras proved, by a counting argument, that for any isometrically embedded tree $T$ on $n$ edges in $Q_n$ there exists a group of translations $G$ such that $\left\{g(T); g\in G \right\}$ is a vertex partition of $Q_n$. Considering a more general context we are able to give an explicit construction of $G$ and can construct non group ...
openaire   +2 more sources

Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure

open access: yesAdvanced Engineering Materials, EarlyView.
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari   +3 more
wiley   +1 more source

Trees with Certain Locating-chromatic Number

open access: yesJournal of Mathematical and Fundamental Sciences, 2016
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

Home - About - Disclaimer - Privacy