相关论文: The centipede is determined by its Laplacian spect…

A constructive method is given for obtaining cospectral vertices in undirected graphs, along with an operation that preserves this construction. We prove that the construction yields cospectral vertices, as well as strongly cospectral…

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…

Given a sequence of regular finite coverings of complete Riemannian manifolds, we consider the covering solenoid associated with the sequence. We study the leaf-wise Laplacian on the covering solenoid. The main result is that the spectrum…

Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the…

The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…

In a graph G; a vertex (resp. an edge) metric generator is a set of vertices S such that any pair of vertices (resp. edges) from G is distinguished by at least one vertex from S: The cardinality of a smallest vertex (resp. edge) metric…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

We introduce a family of new centralities, the k-spectral centralities. k-Spectral centrality is a measurement of importance with respect to the deformation of the graph Laplacian associated with the graph. Due to this connection,…

we define the sunlet graph is the graph obtained by taking one copy of the cycle and joined every vertex of the cycle to an exactly one pendant vertex such that the degree of each vertex in the cycle is three. In this paper, we establish…

Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…

Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.

A geometrical approach to calculate the electric field due to a uniformly charged rod is presented. The result is surprisingly simple and elegant. Using pure geometrical quantities like length and angle, the direction of the electric field…

For natural numbers $k<n$ we study the graphs $T_{n,k}:=K_{k}\lor\overline{K_{n-k}}$. For $k=1$, $T_{n,1}$ is the star $S_{n-1}$. For $k>1$ we refer to $T_{n,k}$ as a \emph{graph of pyramids}. We prove that the graphs of pyramids are…

The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness of the linear operator associated with a graphon. In this…

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…