Results 41 to 50 of about 9,569,640 (309)

Construction of L-equienergetic graphs using some graph operations

open access: yesAKCE 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

The approach to criticality in sandpiles [PDF]

open access: yes, 2010
A popular theory of self-organized criticality relates the critical behavior of driven dissipative systems to that of systems with conservation. In particular, this theory predicts that the stationary density of the abelian sandpile model should be equal
A. A. Járai   +8 more
core   +4 more sources

Times Series Forecasting for Urban Building Energy Consumption Based on Graph Convolutional Network [PDF]

open access: yesApplied Energy, 2021
The world is increasingly urbanizing and the building industry accounts for more than 40% of energy consumption in the United States. To improve urban sustainability, many cities adopt ambitious energy-saving strategies through retrofitting existing ...
Yuqing Hu   +5 more
semanticscholar   +1 more source

On Energy and Laplacian Energy of Graphs

open access: yesThe Electronic Journal of Linear Algebra, 2016
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

The total π-electron energy saga: Continuation [PDF]

open access: yesKragujevac Journal of Science
The total π-electron energy, as calculated within the Hückel molecular orbital approximation, is a much studied quantum chemical characteristics of unsaturated conjugated compounds. Its theory, together with that of its modification called "graph energy",
Gutman Ivan
doaj   +1 more source

Developments in the theory of randomized shortest paths with a comparison of graph node distances [PDF]

open access: yes, 2013
There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance.
Kivimäki, Ilkka   +2 more
core   +2 more sources

Bounds on Energy and Laplacian Energy of Graphs [PDF]

open access: yesJournal of the Indonesian Mathematical Society, 2017
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

Graph states as ground states of many-body spin-1/2 Hamiltonians [PDF]

open access: yes, 2006
We consider the problem whether graph states can be ground states of local interaction Hamiltonians. For Hamiltonians acting on n qubits that involve at most two-body interactions, we show that no n-qubit graph state can be the exact, non-degenerate ...
H. J. Briegel   +4 more
core   +2 more sources

On Relationships of Eigenvalue–Based Topological Molecular Descriptors

open access: yesActa 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

Belief Propagation on replica symmetric random factor graph models [PDF]

open access: yes, 2016
According to physics predictions, the free energy of random factor graph models that satisfy a certain "static replica symmetry" condition can be calculated via the Belief Propagation message passing scheme [Krzakala et al., PNAS 2007].
Coja-Oghlan, Amin, Perkins, Will
core   +4 more sources

Home - About - Disclaimer - Privacy