相关论文: The graph, range and level set singularity spectra…
The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: What additional information is required in order to resolve isospectral…
In connection to the Fuglede conjecture, and to Fuglede's original work \cite{Fug74}, we study one-parameter unitary groups associated to self-adjoint extensions of the differential operator $Df=\frac1{2\pi i}f'$ on a union of finite…
We investigate a class of locally complicated self-affine functions defined via the $Q_s$-representation of real numbers. In particular, we compute local H\"older exponents at points with given asymptotic frequencies of digits in their…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
The number of independent sets in regular bipartite expander graphs can be efficiently approximated by expressing it as the partition function of a suitable polymer model and truncating its cluster expansion. While this approach has been…
A connected graph is called a bi-block graph if each of its blocks is a complete bipartite graph. Let $\mathcal{B}(\mathbf{k}, \alpha)$ be the class of bi-block graph on $\mathbf{k}$ vertices with given independence number $\alpha$. It is…
One can define the notion of primitive length spectrum for a simple regular periodic graph via counting the orbits of closed reduced primitive cycles under an action of a discrete group of automorphisms. We prove that this primitive length…
The goal of multifractal analysis is to characterize the variations in local regularity of functions or signals by computing the Hausdorff dimension of the sets of points that share the same regularity. While classical approaches rely on…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
For a Borel measure and a sequence of partitions on the unit interval, we define a multifractal spectrum based on coarse Holder regularity. Specifically, the coarse Holder regularity values attained by a given measure and with respect to a…
We consider a large class of self-adjoint elliptic problem associated with the second derivative acting on a space of vector-valued functions. We present two different approaches to the study of the associated eigenvalues problems. The…
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…
Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
A multicomplex, also known as a twisted chain complex, has an associated spectral sequence via a filtration of its total complex. We give explicit formulas for all the differentials in this spectral sequence.
The $\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\alpha$-spectral radius of graphs. As applications, we characterize the graphs…