Related papers: On Spectra of Starlike Graphs
The notions of spectral measures and spectral classes, which are well known for graphs, are generalized and investigated for oriented hypergraphs.
We identify a spectroscopic sequence of galaxies, analogous to the Hubble sequence of morphological types, based on the Automatic Spectroscopic K-means (ASK) classification. Considering galaxy spectra as multidimensional vectors, the…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…
This is a survey paper. We study the Ricci curvature and spectrum of graphs, as well as the exterior forms and deRahm cohomology on graphs.
The spectrum of the $k$-power hypergraph of a graph $G$ is called the $k$-ordered spectrum of $G$.If graphs $G_1$ and $G_2$ have same $k$-ordered spectrum for all positive integer $k\geq2$, $G_1$ and $G_2$ are said to be high-ordered…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
We show that a spectrum of frequencies obtained by a random perturbation of the integers allows one to represent any measurable function on R by an almost everywhere converging sum of harmonics almost surely.
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs. In non-regular hypergraphs, we investigate the power of regular graphs, various…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \in \mathbb{N}$ with $k \geq t \geq 2$, the vertices of every $r = s(k-t+1)$-edge-coloured countably infinite complete $k$-graph can be partitioned into the cores of…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
Multiple sets of synthetic spectra of OB-binary stars are used to test the suitability of disentangling for deriving accurate spectroscopic orbits. Given a set of spectra with broad phase coverage and sufficient total integration time…
Let $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
In [Discrete Mathematics 306 (2005) 153-158], So proposed a conjecture saying that integral circulant graphs with different connection sets have different spectra. This conjecture is still open. We prove that this conjecture holds for…