Results 21 to 30 of about 6,339,457 (246)

Bond graph analysis in robust engineering design [PDF]

, 2000
Within engineering design, optimization often involves building models of working systems to improve design objectives such as performance, reliability and cost.
GABBRIELLI R., de Mast, J., Does, R.J.M.M., BRAGLIA, MARCELLO, van den Heuvel, E.R., BRAGLIA M., Heuvel, van den, E.R., Bates, RA, YANG, Zhenlin, BEVILACQUA M., Atherton, MA, GABBRIELLI, ROBERTO, Bates, R. A., Yang, Z., Schippers, W.A.J., Atherton, M. A., Mast, de, J., Does, R.J.M.M.; id_orcid, BEVILACQUA, MAURIZIO, Wu, Shuo-jye; Tsai, Tzong-ru, Xie, M., Gaudoin, O., Wu, Shuo-jye   +22 more
core   +1 more source

Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures

Entropy, 2018
Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a matrix, one can contemplate graph energy, Randić energy, Laplacian energy ...
Mikołaj Morzy, Tomasz Kajdanowicz
doaj   +1 more source

Ideal Graph of a Graph [PDF]

, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source

Construction of L-equienergetic graphs using some graph operations

AKCE International Journal of Graphs and Combinatorics, 2020
For a graph G with n vertices and m edges, the eigenvalues of its adjacency matrix A(G) are known as eigenvalues of G. The sum of absolute values of eigenvalues of G is called the energy of G.
S. K. Vaidya, Kalpesh M. Popat
doaj   +1 more source

Towards a Maude tool for model checking temporal graph properties [PDF]

, 2011
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto, Luch Lafuente A, Vandin, Andrea, Lafuente, Alberto Lluch, Vandin A   +4 more
core   +1 more source

ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]

Journal of Algebraic Systems
Recently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi, Sumanta Borah, Ankur Bharali   +2 more
doaj   +1 more source

ON SPECTRA OF HERMITIAN RANDIĆ MATRIX OF SECOND KIND [PDF]

Journal of Algebraic Systems
Let $X$ be a mixed graph and $\omega=\frac{1+\i \sqrt{3}}{2}$. We write $i\rightarrow j$, if there is an oriented edge from a vertex $v_i$ to another vertex $v_j$, and $i\sim j$ for an un-oriented edge between the vertices $v_i$ and $v_j$.
A Bharali, Bikash Bhattacharjya, Sumanta Borah, Idweep Gogoi   +3 more
doaj   +1 more source

On Relationships of Eigenvalue–Based Topological Molecular Descriptors

Acta Chimica Slovenica, 2020
Three eigenvalue-based topological molecular descriptors are compared using several datasets of alkanes. Two of them are well-known and frequently employed in various QSPR/QSAR investigations, and third-one is a newly derived whose predictive potential ...
Izudin Redžepović, Boris Furtula
doaj   +1 more source

NeMeSys – Energy Adaptive Graph Pattern Matching on NUMA-based Multiprocessor Systems

, 2019
NeMeSys is a NUMA-aware graph pattern processing engine, which leverages intelligent resource management for energy adaptive processing. With modern server systems incorporating an increasing amount of main memory, we can store graphs and compute ...
Ungethüm, Annett, Habich, Dirk, Lehner, Wolfgang, Krause, Alexander, Kissinger, Thomas   +4 more
core   +1 more source

A graph rewriting programming language for graph drawing [PDF]

, 1998
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core   +1 more source