Results 71 to 80 of about 47,947 (303)
Advanced Engineering Materials, EarlyView.Identified through the use of statistical design of experiments and metallographic investigation, this study exposes the stochastic origins of intergranular cracks in blown powder laser beam directed energy deposition additive manufacturing of pure molybdenum. It further demonstrates a successful crack mitigation approach with direct correlation to the
Nathaniel J. Lies +2 more
wiley +1 more source
Heavy paths and cycles in weighted graphs [PDF]
, 1998 A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called the weight of $e$. In this paper, some theorems on the existence of long paths and cycles in unweighted graphs are generalized to heavy paths and cycles ...
Zhang, S. +3 more
core
Alternating cycles and paths in edge-coloured multigraphs: A survey
, 1997 A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs.
Gutin, Gregory +3 more
core +1 more source
Long Dominating Cycles in Graphs [PDF]
, 2007 All graphs considered in this paper will be finite and simple.
Zhiren, Sun, Yongga, A.
core +1 more source
Italian Domination Number for Strong Product of Cycles and Paths
Journal of MathematicsThis paper mainly considers the Italian domination number for strong product of cycles and paths. After constructing some recursive Italian dominating functions, we derive the upper bounds for the Italian domination number of strong product of cycles and
Liyang Wei, Feng Li
doaj +1 more source
Extending partial edge colorings of iterated cartesian products of cycles and paths [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider the problem of extending partial edge colorings of iterated cartesian products of even cycles and paths, focusing on the case when the precolored edges satisfy either an Evans-type condition or is a matching.
Carl Johan Casselgren +2 more
doaj +1 more source
On nonrepetitive colorings of paths and cycles
Discrete Applied Mathematics11 pages, 4 ...
Fábio Botler +2 more
openaire +2 more sources
Even cycle creating paths [PDF]
Journal of Graph Theory, 2019 AbstractWe say that two graphs on the same vertex set are ‐creating if the union of the two graphs contains as a subgraph. Let be the maximum number of pairwise ‐creating Hamiltonian paths of the complete graph . The behavior of is much better understood than the behavior of , the former is an exponential function of whereas the latter is larger ...
openaire +4 more sources
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
Path-sequential labellings of cycles
Discrete Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source