Results 61 to 70 of about 251,801 (209)
Inversion-based control of electromechanical systems using causal graphical descriptions [PDF]
Causal Ordering Graph and Energetic Macroscopic Representation are graphical descriptions to model electromechanical systems using integral causality. Inversion rules have been defined in order to deduce control structure step-bystep from these graphical
F. Giraud +17 more
core +1 more source
General Zagreb adjacency matrix [PDF]
Zhen Lin
doaj +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core +1 more source
On the conjecture of Sombor energy of a graph
The Sombor matrix of a graph G with vertices v1,v2,…,vnis defined as ASO(G)=[sij], where sij=di2+dj2if viis adjacent to vjand sij=0, otherwise, where diis the degree of a vertex vi.
Harishchandra S. Ramane +1 more
doaj +1 more source
Control Energy of Lattice Graphs [PDF]
7 pages, 3 figures, for CDC ...
Isaac S. Klickstein +1 more
openaire +2 more sources
Graph theory-based approach for energy corridors network to Greece
PurposeThe European Union (EU) energy supply environment is changing significantly and in a dynamic way, establishing the issue of safe energy imports as main priority. Greece relies heavily on energy imports. Furthermore, Greece aims to be elevated into
Flouri, M +9 more
core +1 more source
Some New Results on Various Graph Energies of the Splitting Graph
The energy of a simple connected graph G is equal to the sum of the absolute value of eigenvalues of the graph G where the eigenvalue of a graph G is the eigenvalue of its adjacency matrix AG.
Zheng-Qing Chu +4 more
doaj +1 more source
Note on the Randic energy of graphs [PDF]
Summary: If \(G\) is a graph on \(n\) vertices, and \(d_i\) is the degree of its \(i\)-th vertex, then the Randic matrix of \(G\) is the square matrix of order \(n\) whose \((i, j)\)-entry is equal to \(1/\sqrt{d_id_j}\) if the \(i\)-th and \(j\)-th vertex of \(G\) are adjacent, and zero otherwise.
He, Jun, Liu, Yan-Min, Tian, Jun-Kang
openaire +2 more sources
Optimizing energy-efficiency for multi-core packet processing systems in a compiler framework [PDF]
Network applications become increasingly computation-intensive and the amount of traffic soars unprecedentedly nowadays. Multi-core and multi-threaded techniques are thus widely employed in packet processing system to meet the changing requirement ...
Huang, Jing
core

