Results 71 to 80 of about 55,177 (267)
Relating 2-Rainbow Domination To Roman Domination
Discussiones Mathematicae Graph Theory, 2017 For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination
Alvarado José D. +2 more
doaj +1 more source
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
Entropy, 2019 Graph isomorphism is to determine whether two graphs have the same topological structure. It plays a significant role in areas of image matching, biochemistry, and information retrieval.
Kai Liu +5 more
doaj +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
Advanced Engineering Materials, EarlyView.We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source
Discrete evacuation in graphs with multiple exits
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Borowiecki +3 more
openaire +2 more sources
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
Finite approximation of stably compact spaces
Applied General Topology, 2002 Finite approximation of spaces by inverse sequences of graphs (in the category of so-called topological graphs) was introduced by Smyth, and developed further.
M.B. Smyth, J. Webster
doaj +1 more source
Discrete p-bilaplacian Operators on Graphs [PDF]
, 2020 In this paper, we first introduce a new family of operators on weighted graphs called p-bilaplacian operators, which are the analogue on graphs of the continuous p-bilaplacian operators. We then turn to study regularized variational and boundary value problems associated to these operators.
El Bouchairi, Imad +2 more
openaire +1 more source
Advanced Engineering Materials, EarlyView.This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source
Comptes Rendus. MathématiqueWe give a new family of Karhunen-Loève expansions involving Hahn polynomials. This enables us to introduce discrete analogues of Watson statistics, and a test for uniformity on Johnson’s graphs. We use the fact that the zonal spherical functions on these
Pycke, Jean-Renaud
doaj +1 more source