Results 101 to 110 of about 30,707 (261)
Degree based energy and spectral radius of a graph with self-loops
Let GX be a graph obtained from a simple graph G by attaching a self-loop at each vertex of [Formula: see text]. The general extended adjacency matrix for the graph GX is defined and the bounds for the degree based energy of the graph GX are obtained ...
Shashwath S. Shetty, Arathi Bhat K
doaj +1 more source
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph.
Fatih Yılmaz, Durmuş Bozkurt
doaj +1 more source
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Semigraph is a generalization of graph. We introduce the concept of energy in a semigraph in two ways, one, the matrix energy , as summation of singular values of the adjacency matrix of a semigraph, and the other, polynomial energy , as energy of the ...
Gaidhani Y.S. +2 more
doaj +1 more source
Creep‐Induced Microstructural Evolution in an A2‐B2 Superalloy
A 27.3Ta‐27.3Mo‐27.3Ti‐8Cr‐10Al (at.%) refractory high‐entropy alloy with precipitation‐strengthened A2‐B2 microstructure was studied by creep tests at 1030°C, which demonstrate a transition in deformation mechanisms in the range of 100–150 MPa applied stress. This is associated with changes in dislocation–precipitate interactions. Relevant deformation
Liu Yang +10 more
wiley +1 more source
This article focused on the notion of the non-abelian tensor product of groups of prime power order. Particularly, it presented new graph named as Non-compatible action graph and discussed some of its properties. Moreover, this graph concentrated on the
mohd Shahoodh
doaj +1 more source
Unified Spectral Bounds on the Chromatic Number
One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn.
Elphick Clive, Wocjan Pawel
doaj +1 more source
Fuzzy Adjacency Matrix In Graphs
In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples .
Taheri, Mahdi, Mehrana Niroumand
openaire +1 more source
Do not let thermal drift and instrument artifacts deceive high‐temperature nanoindentation results. We compare classical Oliver–Pharr and automatic image recognition analyses across steels and a Ni alloy to quantify these effects. Accounting for artifacts reveals systematic softening with temperature, while Cr and Ni additions boost resistance ...
Velislava Yonkova +2 more
wiley +1 more source
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source

