Results 81 to 90 of about 251,801 (209)
Bond Graph Multi-time Scale Analysis of a Railway Traction System [PDF]
, 2001 The unified formalism of bond graphs is applicable to designing, modeling and analyzing complex and heterogeneous physical systems. Moreover, various order-reduction methods can be applied directly on bond graph models in order to simplify them.
Sareni, Bruno +3 more
core
ENERGY OF NON-COPRIME GRAPH ON MODULO GROUP
BarekengA graph is a mathematical structure consisting of a non-empty set of vertices and a set of edges connecting these vertices. In recent years, extensive research on graphs has been conducted, with one of the intriguing topics being the representation of ...
Gusti Yogananda Karang +2 more
doaj +1 more source
Relating graph energy and Sombor index
, 2022 The energy of a graph (ε) is the sum of absolute values of its eigenvalues, thus it is a graph-spectrum-based quantity. The Sombor index (SO) is a recently conceived vertex-degree-based topological index.
GÜRSOY, Arif +3 more
core +1 more source
Energy Models for Graph Clustering
Journal of Graph Algorithms and Applications, 2007 Summary: The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software systems. Layouts can naturally represent the cluster structure of graphs by grouping densely connected nodes and separating sparsely connected nodes.
openaire +1 more source
On net-Laplacian energy of signed graphs
Communications in Combinatorics and Optimization, 2017 A signed graph is a graph where the edges are assigned either positive or negative signs. Net degree of a signed graph is the difference between the number of positive and negative edges incident with a vertex. It is said to be net-regular if all its
Nutan G. Nayak
doaj +1 more source
Some properties of maximum deficiency energy of a graph [PDF]
Computer Science Journal of Moldova, 2021 The concept of maximum deficiency matrix $M_{df}(G)$ of a simple graph $G$ is introduced in this paper. Let $G=(V,E)$ be a simple graph of order $n$ and let $df(v_{i})$ be the deficiency of a vertex $v_{i}$, $i=1,2, \ldots, n$, then the maximum ...
Omendra Singh, Pravin Garg, Neha Kansal
doaj
The distance seidel spectrum of some graph operations [PDF]
Journal of HyperstructuresThe distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied in detail in literature where as the study on distance seidel matrix associated with a connected graph is in progress. The eigenvalues ∂1S≥∂2S≥ ...
Deena Scaria, Indulal Gopal
doaj +1 more source
Thermoeconomics as a tool for the design and analysis of energy savings initiatives in buildings connected to district heating networks [PDF]
, 2012 District Heating (DH) is a rational way to supply heat to buildings in urban areas. This is expected to play an important role in future energy scenarios, mainly because of the possibility to recover waste heat and to integrate renewable energy sources ...
Kona Albana +2 more
core
Systemic design of multidisciplinary electrical energy devices: a pedagogical approach [PDF]
, 2009 In this paper, we present a complete educative project for illustrating the design and the analysis of hybrid electrical systems. It is based on the study of an ElectroHydrostatic Actuator for flight control application, fed by a power supply associating
Sareni, Bruno +2 more
core
On bipartite graphs with minimal energy
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xueliang Li 0001 +2 more
openaire +1 more source