Results 21 to 30 of about 251,801 (209)
On Energy and Laplacian Energy of Graphs
Let $G=(V,E)$ be a simple graph of order $n$ with $m$ edges. The energy of a graph $G$, denoted by $\mathcal{E}(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. The Laplacian energy of the graph $G$ is defined as \[ LE = LE(G)=\sum^n_{i=1}\left|\mu_i-\frac{2m}{n}\right| \] where $\mu_1,\,\mu_2,\,\ldots,\,\mu_{n-1 ...
Das, Kinkar Ch., Mojalal, Seyed Ahmad
openaire +1 more source
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
Smarandache-Zagreb Index on Three Graph Operators [PDF]
Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
On distance Laplacian energy in terms of graph invariants
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A. +3 more
core +1 more source
Time-Dependent Lagrangian Energy Systems on Supermanifolds with Graph Bundles
The aim of this article is firstly to improve time-dependent Lagrangian energy equations using the super jet bundles on supermanifolds. Later, we adapted this study to the graph bundle.
Cansel Aycan, Simge Şimşek
doaj +1 more source
On the spectrum, energy and Laplacian energy of graphs with self-loops
The total energy of a conjugated molecule's π-electrons is a quantum-theoretical feature that has been known since the 1930s. It is determined using the Huckel tight-binding molecular orbital (HMO) method.
Ugasini Preetha P +2 more
doaj +1 more source
Bounds on Energy and Laplacian Energy of Graphs [PDF]
Let G be simple graph with n vertices and m edges. The energy E(G) of G, denotedby E(G), is dened to be the sum of the absolute values of the eigenvalues of G. Inthis paper, we present two new upper bounds for energy of a graph, one in terms ofm,n and another in terms of largest absolute eigenvalue and the smallest absoluteeigenvalue.
Sridhara, G., Kanna, Rajesh M. R.
openaire +2 more sources
Node-attribute graph layout for small-world networks [PDF]
Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Joe Faith +3 more
core +1 more source
Investigation of the Main Energies of Picture Fuzzy Graph and its Applications
Picture fuzzy graph, belonging to fuzzy graphs family, has good capabilities at times when we are faced with problems that cannot be expressed by fuzzy graphs and intuitionistic fuzzy graphs.
Xiaolong Shi +4 more
doaj +1 more source
Bond graph analysis in robust engineering design [PDF]
Within engineering design, optimization often involves building models of working systems to improve design objectives such as performance, reliability and cost.
GABBRIELLI R. +22 more
core +1 more source

