Related papers: On Spectra of Starlike Graphs
In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the…
A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one…
We propose a simple method for resolution of co-spectrality of Schr\"odinger operators on metric graphs. Our approach consists of attaching a lead to them and comparing the $S$-functions of the corresponding scattering problems on these…
In this paper we consider the uniformly resolvable decompositions of the complete graph $2K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the cases…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star points). We consider the use of SS to find any member of a…
The use of a method of spectra disentangling for telluric lines is explained in detail, with a particular emphasis on high-precision radial-velocity measurements for the search for extrasolar planets. New improvements to the method are…
The primary objective of this paper is to generalize the results of [arXiv:2111.03548] to the case of quasi-smooth Berkovich curves by establishing a connection between the spectrum and the radii of convergence. To achieve this, we…
With the "iso-H\"older" sets of a function we naturally associate subsets of the graph, range and level set of the function. We compute the associated singularity spectra for a class of statistically self-similar multifractal functions,…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations.…
We examine a search on a graph among a number of different kinds of objects (vertices), one of which we want to find. In a standard graph search, all of the vertices are the same, except for one, the marked vertex, and that is the one we…
Asteroseismology has been extremely successful in determining the properties of stars in different evolutionary stages with a remarkable level of precision. However, to fully exploit its potential, robust methods for estimating stellar…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
For $0\leq \alpha <1$, the sharp radii of starlikeness and convexity of order $\alpha$ for functions of the form $f(z)=z+a_2z^2+a_3z^3+...$ whose Taylor coefficients $a_n$ satisfy the conditions $|a_2|=2b$, $0\leq b\leq 1$, and $|a_n|\leq n…
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We determine (multi)graded Betti numbers of path ideals of lines and star graphs.
Let $G$ be a connected simple graph of order $n$. Let $\rho_1(G)\geq \rho_2(G)\geq \cdots \geq \rho_{n-1}(G)> \rho_n(G)=0$ be the eigenvalues of the normalized Laplacian matrix $\mathcal{L}(G)$ of $G$. Denote by $m(\rho_i)$ the multiplicity…