Results 1 to 10 of about 93,693 (162)
A Multimodal Representation Learning Framework for Molecular Graph and NMR Spectrum Alignment [PDF]
Accurate matching between molecular structures and NMR spectra is an important task in automated structure elucidation. However, existing methods still face difficulties in jointly modeling multi-scale molecular topology and effectively exploiting the ...
Xiao Li +4 more
doaj +2 more sources
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +2 more sources
Accurate prediction of tensorial spectra using equivariant graph neural network [PDF]
Optical spectroscopies provide a powerful means to probe light-matter interactions and complex electronic features that are crucial for the development and optimization of optoelectronic devices, where performance is closely tied to the underlying ...
Ting-Wei Hsu +3 more
doaj +2 more sources
Simplices and Spectra of Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bojan Mohar, Igor Rivin
openaire +2 more sources
Contribution of directedness in graph spectra
In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter ...
Javeria Amreen, Sudev Naduvath
doaj +1 more source
Spectral recognition of graphs [PDF]
At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra.
Cvetković Dragoš
doaj +1 more source
On the distance spectra of m-generation n-prism graph
The distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism graph or (m,
Fouzul Atik +2 more
doaj +1 more source
The spectral characterization of the connected multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let and denote a complete graph and a complete bipartite graph, respectively.
Ali Zeydi Abdian +2 more
doaj +1 more source
SPECTRA OF PRINCIPAL GRAPHS [PDF]
We show that if the adjacency matrices of the two principal graphs of a finite index subfactor are regarded as (necessarily bounded, self-adjoint) operators on the ℓ2 spaces over their vertex sets, then their spectral measures, when restricted to the complement of {0}, are mutually absolutely continuous.
Kodiyalam, Vijay, Sunder, V. S.
openaire +2 more sources

