Results 21 to 30 of about 96,121 (306)
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
Some new models for multiprocessor interconnection networks [PDF]
Yugoslav Journal of Operations Research, 2016 A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply ...
Cvetković Dragoš +2 more
doaj +1 more source
The spectral determination of the connected multicone graphs
AKCE International Journal of Graphs and Combinatorics, 2021 The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle.
Ali Zeydi Abdian +4 more
doaj +1 more source
The convexity spectra of graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li-Da Tong +2 more
openaire +2 more sources
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.
Anuj Dawar +2 more
openaire +3 more sources
Endomorphism spectra of graphs
Discrete Mathematics, 1992 Consider graphs \(G,H\) and a mapping \(f:V(G) \to V(H)\). Suppose that \(f\) is a homomorphism of \(G\) to \(H\), i.e., that any two vertices \(u,v\) in \(f(V(G))\), for which the sets \(f^{-1} (u)\) and \(f^{-1}(v)\) are joined in \(G\) by at least one edge, are adjacent in \(H\). If also conversely, for any two vertices \(u,v \in f(V(G))\) which are
Michael Böttcher, Ulrich Knauer
openaire +1 more source
Journal of Combinatorial Theory, Series B, 1984 The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the literature. Not nearly as much seems to be known about bounds on other eigenvalues of the spectrum. Several results are presented here toward that goal, first for the general class of simple graphs, then for triangle-free graphs and finally for the even
Brigham, R. C., Dutton, R. D.
openaire +3 more sources
The Gewirtz Graph: An Exercise in the Theory of Graph Spectra [PDF]
European Journal of Combinatorics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andries E. Brouwer, Willem H. Haemers
openaire +2 more sources
Structural differentiation of graphs using Hosoya-based indices. [PDF]
PLoS ONE, 2014 In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which
Matthias Dehmer +2 more
doaj +1 more source