Results 21 to 30 of about 323,816 (328)
Spectral recognition of graphs [PDF]
Yugoslav Journal of Operations Research, 2012 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
Descriptive complexity of graph spectra [PDF]
Annals of Pure and Applied Logic, 2016 Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these properties in relation to logical definability.
Dawar, Anuj +2 more
openaire +3 more sources
The Spectra of Coxeter Graphs [PDF]
Journal of Algebraic Combinatorics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A.E., Riebeek, R.J.
openaire +3 more sources
On molecular graphs and digraphs of annulenes and their spectra [PDF]
Journal of the Serbian Chemical Society, 2001 Amolecular graph, consisting of undirected edges, can be represented as a sum of two digraphs, consisting of oppositely oriented directed edges. In the case of annulenes, the eigenvalue spectrum of the molecular graph is equal to the sum of the ...
Gutman Ivan, Plath Peter J.
doaj +3 more sources
European Journal of Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Gerard-J. +2 more
openaire +2 more sources
Weisfeiler-Leman and Graph Spectra
, 2023 Error in Theorem 1.4 ...
Rattan, Gaurav, Seppelt, Tim
openaire +2 more sources
Simplices and Spectra of Graphs [PDF]
Discrete & Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohar, Bojan, Rivin, Igor
openaire +2 more sources
Heat Kernel Embeddings, Differential Geometry and Graph Structure
Axioms, 2015 In this paper, we investigate the heat kernel embedding as a route to graph representation. The heat kernel of the graph encapsulates information concerning the distribution of path lengths and, hence, node affinities on the graph; and is found by ...
Hewayda ElGhawalby, Edwin R. Hancock
doaj +1 more source
Skew Spectra of Oriented Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 An oriented graph $G^{\sigma}$ is a simple undirected graph $G$ with an orientation $\sigma$, which assigns to each edge a direction so that $G^{\sigma}$ becomes a directed graph. $G$ is called the underlying graph of $G^{\sigma}$, and we denote by $Sp(G)$ the adjacency spectrum of $G$.
Shader, Bryan, So, Wasin
openaire +2 more sources
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
Special Matrices, 2018 A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source