Search Results

On n-vertices, how many isospectral graphs exist? [..I saw this previous "historic" discussion between two of the stalwarts in this field - Operation on Isospectral graphs ] Given a graph are t …

if a graph with adjacency matrix $A$ and Laplacian $L$ has $k$ distinct eigenvalues then does this fact naturally help define or prove existence of a polynomial $p$ of degree $k-1$ such that $[p(A)]_{ …

If the edges of a bipartite graph are such that they can be seen as a disjoint union of perfect matchings then will this somehow reflect in the eigenvalues of the Laplacian? It would be helpful to g …

I noticed an apparent conflict in the definition in literature about what is a "Ramanujan graph, which I was wondering if someone could kindly clarify. (1) The Hoory-Linial-Wigderson review on expand …

We know that a $2-$ lift of a graph is specified by a $\pm 1$ assignment on the edges of the graph ( given as a signing matrix) denoting which edge is to be duplicated by the identity permutation on t …

If $B$ is a symmetric matrix then how do its eigenvalues compare to the eigenvalues of $B - vv^T$? ( where $v$ is a vector of the same dimension as $B$) I guess that the eigenvalues of $B - vv^T$ w …

Given two polynomials $p$ and $q$ over reals and being guaranteed that both have all roots real I want to know if there is any characterization of the solutions of the equation $\frac{p'}{p} = \frac{q …

Say $B$ is a real symmetric matrix of dimension $n$ and $A$ is another real symmetric matrix of the same dimension. What needs to be the bounds on (which?) norm of $B$ to ensure that $\lambda_{max …

Let $\ (V\ E)\ $ be a graph, i.e. $\ E\subseteq\binom V2.\ $ A $2$-lift pattern of a graph is a function $\ e:E\rightarrow\{-1\,\ 1\}.\ $ The induced 2-lift is defined as the graph $\ V\times\{-1\,\ …

Given two positive integers $n$ and $a \leq \frac{n}{2}$ consider a $n \times n$ matrix $A$ such that, all the diagonal entries are either $a$ or $a+1$ all the non-zero off-diagonal entries are $\p …

Is there any connection known between the two? One can naturally define lifts of graphs by groups like $\mathbb{Z}_k$ and hence I wonder if representation theoretic properties can be used to say som …

This question is motivated by the results in this paper, http://calvino.polito.it/~camporesi/JMP94.pdf In this paper some of its most important results about the asymptotics of symmetric traceless …

I seem to see three different things that are being called the Laplacian of a graph, One is the matrix $L_1 = D - A$ where $D$ is a diagonal matrix consisting of degrees of all the vertices and $A$ …

The Bilu-Linial conjecture claims that every $d-$regular graph has a $2-$lift such that for the signing matrix has its eigenvalues between $[-2\sqrt{d-1},2\sqrt{d-1}]$ (the ``signing matrix" is the a …

Is it purely coincidental that the same number $2\sqrt{d-1}$ appears in these two following apparently disparate concepts? A $d-$regular graph is said to be called Ramanujan if its adjacency eigenv …