Results 101 to 110 of about 1,619,561 (291)
γ-Inverse graph of some mixed graphs
Special MatricesLet GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa +2 more
doaj +1 more source
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
Node Importance Identification for Temporal Networks Based on Optimized Supra-Adjacency Matrix. [PDF]
Entropy (Basel), 2022 Liu R, Zhang S, Zhang D, Zhang X, Bao X.
europepmc +1 more source
Advanced Engineering Materials, EarlyView.Scandium (Sc)‐doped AlCoCrFeMo HEA coatings are fabricated via flame spraying with 0.1, 0.3, and 0.5 wt% Sc additions. Among these, the HEA‐Sc0.3 coating exhibits the highest corrosion resistance, indicated by a more positive corrosion potential and lower current density.
Pankaj Kumar +7 more
wiley +1 more source
The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank [PDF]
We look for the maximum order of a square (0, 1)-matrix A with a fixed rank r, provided A has no repeated rows or columns. If A is the adjacency matrix of a graph, Kotlov and Lovász [J. Graph Theory 23, 1996] proved that the maximum order equals Θ(2r/2).
Peeters, M.J.P., Haemers, W.H.
core
The Relation Between Topological Ordering and Adjacency Matrix in Digraphs [PDF]
, 2012 . In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related.
N Delfan, T Rastad
core
Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
, 2013 For a simple graph G, let rank(G) and dnzr(G) denote respectively the rank and the number of distinct nonzero rows of the adjacency matrix A(G) of G. Equivalent conditions are given for the join G1∨G2 of two vertex-disjoint graphs G1,G2 to satisfy rank ...
Huang, Liang-Hao; Tam, Bit-Shun; Wu, Shu-Hui +1 more
core +1 more source
Advanced Engineering Materials, EarlyView.Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati +11 more
wiley +1 more source
On the mixed adjacency matrix of a mixed graph
, 2016 A mixed graph is a graph with edges and arcs, which can be considered as a hybrid of an undirected graph and a directed graph. In this paper we define the mixed adjacency matrix and the mixed energy of a mixed graph.
Adiga, Chandrashekar +2 more
core +1 more source