Results 71 to 80 of about 42,675 (259)
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
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
An Approach to Evaluating the Number of Closed Paths in an All-One Base Matrix
IEEE Access, 2018 Given an all-one base matrix of size M×N, a closed path of different lengths can be formed by starting at an arbitrary element and moving horizontally and vertically alternatively before terminating at the same “starting” element ...
Sheng Jiang, Francis C. M. Lau
doaj +1 more source
Cycles and paths in Jacobson graphs
Ars Comb., 2014 11 pages, 10 ...
Ali Azimi +1 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
Characterization of Fractional Mixed Domination Number of Paths and Cycles
Journal of MathematicsLet G′ be a simple, connected, and undirected (UD) graph with the vertex set M(G′) and an edge set N(G′). In this article, we define a function f:M∪N⟶0,1 as a fractional mixed dominating function (FMXDF) if it satisfies fRmx=∑yϵRmxfy≥1 for all x∈MG′∪NG′,
P. Shanthi +5 more
doaj +1 more source
Formalized MathematicsSummary In this article path and cycle graphs are formalized in the Mizar system.
openaire +2 more sources
On paths and cycles dominating hypercubes
Discrete Mathematics, 2003 Let \(\text{c}_n\), \(\text{p}_n\) and \(\text{cyc}_n\) denote the minimum number of vertices in a dominating set, a dominating path and a dominating cylce of the \(n\)-dimensional hypercube, respectively. The authors prove that \(\text{cyc}_n \leq 2^{m-p}(2^k+2)\) for \(p\geq 2\), \(m=2^p-1\), \(1\leq k\leq 2^p\) and \(n=m+k\), \(\text{c}_n\geq 2 ...
Tomás Dvorák +2 more
openaire +1 more source
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
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges
Discussiones Mathematicae Graph Theory, 2015 We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), and k(p + q) = 2mn for
Jeevadoss Shanmugasundaram +1 more
doaj +1 more source