Related papers: On Spectra of Starlike Graphs
This paper extends our previous works arXiv:1802.07306 [math.NT], arXiv:1808.02382 [math.NT] on determining the spectrum, in the Berkovich sense, of ultrametric linear differential equations. Our previous works focused on equations with…
A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a star coloring of G is called star chromatic number, denoted…
An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
The oscillation spectrum of pressure waves in stars can be determined by monitoring their luminosity. For rapidly rotating stars, the corresponding ray dynamics is mixed, with chaotic and regular zones in phase space. Our numerical…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…
Periodicity analysis of unevenly collected data is a relevant issue in several scientific fields. In astrophysics, for example, we have to find the fundamental period of light or radial velocity curves which are unevenly sampled…
The pineapple graph $K_p^q$ is obtained by appending $q$ pendant edges to a vertex of a complete graph $K_{p}$ ($q\geq 1,\ p\geq 3$). Zhang and Zhang ["Some graphs determined by their spectra", Linear Algebra and its Applications, 431…
List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called choosability with separation, requires that the intersection…
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph, a separation is a pair of sets of vertices X and Y such that there are no arcs from X and Y . For a subclass of eulerian digraphs, we give…
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
We compute the connective spectra of maps from $\mathbb{Z}$ to the Picard spectra of the spherical Witt vectors associated with perfect rings of characteristic $p$. As an application, we determine the connective spectrum of maps from…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We show that the star graph defined as the Cayley graph of ${\mathfrak S}_{n+1}$ generated by the star transpositions is an ${\mathfrak S}_n$-cover of the complete graph $K_{n+1}$, which is known to have fine spectral properties. In the…
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the…
This paper gives the pointwise H\"older (or multifractal) spectrum of continuous functions on the interval $[0,1]$ whose graph is the attractor of an iterated function system consisting of $r\geq 2$ affine maps on $\mathbb{R}^2$. These…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…