期刊： RUSSIAN METALLURGY, 2021; 2021 (4)
The inverse pole figures built at the consecutive stages of compressive tests by 1-6% in the longitudinal and transverse directions of pressed rods ma......
期刊： RUSSIAN METALLURGY, 2021; 2021 (3)
The chemical and phase compositions and the surface layer structure of a chromium- and aluminum-alloyed nickel-based alloy after quenching, aging, and......
期刊： RUSSIAN METALLURGY, 2021; 2021 (6)
Metallographic and X-ray diffraction analyses are used to study the effect of rapid solidification (RS) by pendant melt drop extraction (PMDE) on the ......
期刊： RUSSIAN METALLURGY, 2021; 2021 (1)
A Gleeble 3500 physical modeling complex is used to deform graphitized steel (0.46% C) with a microstructure mainly consisting of ferrite and graphite......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (3)
Compressed sensing (CS) is a new data acquisition theory taking full use of the sparsity of signals. It reveals that higher-dimensional sparse signals......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (3)
The folded hypercube is an important interconnection network for multiprocessor systems. Let FQ(n) with n > 7 denote an n-dimensional folded hyperc......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (3)
A (k, r)-hued coloring of a graph G is a proper k-coloring phi such that vertical bar phi(N-G(v))vertical bar >= min{d(G)(v), r} for any vertex v. ......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (6)
In this paper, we investigate the linear dynamical system f : Z(pt)(2) -> Z(pt)(2), where Z(pt) is the ring of integers modulo p(t) (p is a prime).......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (6)
The vertex arboricity va(G) of a graph G is the minimum number of colors the vertices of the graph G can be colored so that every color class induces ......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (6)
The (2, 1)-total choice number of G, denoted by C-(2,1)(T)(G), is the minimum k such that G is k-(2, 1)-total choosable. It was proved in [Y. Yu, X. Z......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (6)
A C4C8 net is a trivalent decoration made by alternating square C-4 and octagons C-8. It can cover either a cylinder or a tori. Cayley graph Cay(G,S) ......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (5)
The unit graph of a ring R is the simple graph, denoted by G(R), whose vertex set is R, and in which two distinct vertices x and y are adjacent if and......
期刊： DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020; 12 (5)
In this paper, we study the time-bounded adaptive information coverage problem with myopic feedback (TBAIC) under a variant of the independent cascade......
