Results 71 to 80 of about 34,319 (321)

On vertex b-critical trees [PDF]

Opuscula 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, Noureddine Ikhlef Eschouf, Frédéric Maffray   +2 more
doaj   +1 more source

On the Total Set Chromatic Number of Graphs

Theory 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, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz   +2 more
doaj   +1 more source

Photocatalytic Versus Stoichiometric Hydrogen Generation Using Mesoporous Silicon Catalysts: The Complex Role of Sacrificial Reagents

Advanced Functional Materials, EarlyView.
This study highlights the importance of accounting for stoichiometric hydrogen produced when utilizing Si photocatalysts. The stoichiometric contribution is sacrificial reagent dependent and decreases with increasing sterics around the catalyst surface.
Sarrah H. Putwa, Sarah A. Martell, Berthold Reis, Simona Schwarz, Mita Dasog   +4 more
wiley   +1 more source

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

JTAM (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, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +1 more source

The Locating Chromatic Number of Book Graph

Journal 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, Wisnu Aribowo, Maiyudi Mariska Windra Yahya   +2 more
doaj   +1 more source

Patterning the Void: Combining L‐Systems with Archimedean Tessellations as a Perspective for Tissue Engineering Scaffolds

Advanced Functional Materials, EarlyView.
This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou, Kenny A. van Kampen, Pierpaolo Fucile, Carlos Mota, Lorenzo Moroni   +4 more
wiley   +1 more source

Improved Bounds for Some Facially Constrained Colorings

Discussiones Mathematicae Graph Theory, 2023
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj   +1 more source

Exploiting Two‐Photon Lithography, Deposition, and Processing to Realize Complex 3D Magnetic Nanostructures

Advanced Functional Materials, EarlyView.
Two‐photon lithography (TPL) enables 3D magnetic nanostructures with unmatched freedom in geometry and material choice. Advances in voxel control, deposition, and functionalization open pathways to artificial spin ices, racetracks, microrobots, and a number of additional technological applications.
Joseph Askey, Arjen van den Berg, Sandra Ruiz Gomez, Claire Donnelly, Dirk Grundler, Sam Ladak   +5 more
wiley   +1 more source

Global Dominator Coloring of Graphs

Discussiones Mathematicae Graph Theory, 2019
Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let 𝒞 = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G).
Hamid Ismail Sahul, Rajeswari Malairaj
doaj   +1 more source

Thickness‐Dependent Skyrmion Evolution in Fe3GeTe2 During Magnetization Reversal

Advanced Functional Materials, EarlyView.
Thickness‐ and field‐dependent magnetic domain behavior in 2D van der Waals Fe3GeTe2 is studied using Lorentz TEM and micromagnetic simulations. A patch‐like domain phase evolves from skyrmions during magnetization reversal, and step edges between thickness regions act as pinning sites.
Jennifer Garland, John Fullerton, PeiYu Cai, Rabindra Basnet, Santosh Karki Chhetri, Jin Hu, Elton J. G. Santos, Yue Li, Charudatta Phatak, Amanda Petford‐Long   +9 more
wiley   +1 more source