Related papers: Quantum trees which maximize higher eigenvalues ar…
The paper is concerned with the maximization of Laplace eigenvalues on surfaces of given volume with a Riemannian metric in a fixed conformal class. A significant progress on this problem has been recently achieved by Nadirashvili-Sire and…
This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\it minimum normalized cuts}/{\it isoperimteric…
The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
Phylogenetic trees are important tools in the study of evolutionary relationships between species. Measures such as the index of Sackin, Colless, and Total Cophenetic have been extensively used to quantify tree balance, one key property of…
We show that any second eigenfunction of the Laplacian with standard vertex conditions on a metric tree graph attains its extremal values only at degree one vertices, and give an example where these vertices do not realise the diameter of…
The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…
In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected…
In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…
Given a length function on the set of edges of a finite graph, the corresponding Fujiwara Laplacian is defined. We consider a problem of maximizing the first nonzero eigenvalue of this graph Laplacian over all choices of edge-length…
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of…
The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio…
Let $T$ be a tree. Suppose $\lambda$ is an eigenvalue of the Laplacian matrix of $T$ with multiplicity $m_{T}(\lambda)$. It is known that $m_{T}(\lambda) \leq p(T)-1$, where $p(T)$ is the number of pendant vertices of $T$. In this paper, we…
We investigate the inner vertex-isoperimetric problem on the $d$-regular tree $T_d$. We first determine the exact value of the inner vertex-isoperimetric profile $I_d(k) = \min\{ |\partial D| \mid D\subset T_d \text{ finite and connected},\…
A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…
Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…
We show that for any positive integer k, the k-th nonzero eigenvalue of the Laplace-Beltrami operator on the two-dimensional sphere endowed with a Riemannian metric of unit area, is maximized in the limit by a sequence of metrics converging…