Related papers: On Spectra of Starlike Graphs

A graph $G$ is $F$-free if $G$ does not contain $F$ as a subgraph. Let $\rho(G)$ be the spectral radius of a graph $G$. Let $\theta(1,p,q)$ denote the theta graph, which is obtained by connecting two distinct vertices with three internally…

For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of…

We investigate the integrated spectra of a sample of 24 normal galaxies. A principal component analysis suggests that most of the variance present in the spectra is due to the differences in morphology of the galaxies in the sample. We show…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

The notion of a K3 spectrum is introduced in analogy with that of an elliptic spectrum and it is shown that there are "enough" K3 spectra in the sense that for all K3 surfaces X in a suitable moduli stack of K3 surfaces there is a K3…

In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the $2$-clique extension of the $(t+1)\times(t+1)$-grid is determined by its spectrum when $t$ is large…

We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.

Let $\varepsilon(G)$ be the eccentricity matrix of a graph $G$ and $Spec(\varepsilon(G))$ be the eccentricity spectrum of $G$. Let $H[G_1,G_2,\ldots, G_k]$ be the $H$-join of graphs $G_1,G_2,\ldots, G_k$ and let $H[G]$ be lexicographic…

In this paper we consider a scalar parabolic equation on a star graph; the model is quite general but what we have in mind is the description of traffic flows at a crossroad. In particular, we do not necessarily require the continuity of…

The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between…

In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as $v_1, v_2, \ldots, v_n$, so that for each $2 \le i \le n$, vertex $v_i$ is either adjacent…

We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…

A graph $G$ is said to be \textit{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$. In \cite{WX,WX1}, Wang and Xu gave…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

We describe a general approach of determining the distribution of spanning subgraphs in the random graph $\G(n,p)$. In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a…

Given a graph $H$, a graph is said to be $H$-free if it does not contain $H$ as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its chromatic number. For a graph $H$ with a chromatic number of…

We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\pm 1$ and decide which of these graphs are determined by their spectrum. This includes the so-called friendship graphs,…

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…