Results 71 to 80 of about 213,457 (302)

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

Bounded vertex colorings of graphs

open access: yesDiscrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Hansen   +2 more
openaire   +1 more source

On Colorful Vertex and Edge Cover Problems

open access: yesAlgorithmica, 2023
In this paper, we study two generalizations of Vertex Cover and Edge Cover, namely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex Cover problem, given an $n$-vertex edge-colored graph $G$ with colors from $\{1, \ldots, ω\}$ and coverage requirements $r_1, r_2, \ldots, r_ω$, the goal is to find a minimum-sized set of vertices that
Sayan Bandyapadhyay   +2 more
openaire   +2 more sources

On vertex b-critical trees [PDF]

open access: yesOpuscula Mathematica, 2013
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors.
Mostafa Blidia   +2 more
doaj   +1 more source

Modular Coloring and Switching in Some Planar Graphs

open access: yesRatio Mathematica, 2023
For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
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

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik   +5 more
doaj   +1 more source

Design and Analysis of Compression–Torsion Coupling Metamaterials Using the Golden Section Method

open access: yesAdvanced Engineering Materials, EarlyView.
A novel compression–torsion metamaterial is engineered using inclined rods and symmetry breaking. To optimize its torsional performance, the golden section method is employed. The mechanical response of the metamaterial is validated through both numerical analysis and experimental validation.
Amirhossein Hassani, Sara Bagherifard
wiley   +1 more source

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

On the Total Set Chromatic Number of Graphs

open access: yesTheory and Applications of Graphs, 2022
Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets.
Mark Anthony C. Tolentino   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy