ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Technology
Mathematics
Education
Computing
Computing
Pure sciences
Biology
Architecture and Urbanism
Physical
Research
all records (74)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Brazil
Australia
Ukraine
Chile
Italy
South Africa
Canada
Russia
all records (75)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
16.310  Articles
1 of 1.631 pages  |  10  records  |  more records»
The notion of the matrix Jacobson graph was introduced in 2019. Let R be a commutative ring and J(R) be the Jacobson radical of ring R. The matrix Jacobson graph of ring R size m × n, denoted ??(R)m × n, is def... see more

Any type of machining operation is well influenced by the machinability of work material under processing. This work proposes a graph theory and matrix method based technique for the assessment of machinability of titanium in ultrasonic machining. Identif... see more

The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property. Adjacency and distance matrices are both symmetric matri... see more

In this paper, we give a relation between the eigenvalues of the antiadjacency matrix of Cay(Z_n, S) and the eigenvalues of the antiadjacency matrix of Cay(Z_n, (Z_n-{0})-S), as well as the eigenvalues of the adjacency matrix of Cay(Z_n, S). Then, we give... see more

The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths Pn&nb... see more

Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graphs hav... see more

In this work we use the transfer matrix method to study the tunneling of Dirac electrons through aperiodic monolayer graphene superlattices. We consider a graphene sheet deposited on top of slabs of Silicon-Oxide (SiO2) and Silicon-Carbide (SiC) substrate... see more

We used the transfer-matrix method to study the tunneling of Dirac eletrons through graphene superlattices. We have considered two types of sinusoidal superlattices: (1) electrostatic-barrier structures created by application of electrostatic potentials a... see more

This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph parameters like the number of vertices, the number of e... see more

1 of 1.631 pages  |  10  records  |  more records»