Let $\mathcal{L}$ be the Laplacian matrix of a connected, undirected and unweighted graph $\mathcal{G}$ with $n$ vertices, and let $\Delta \in \mathbb{R}^{n\times n}$ be a diagonal matrix with at least one nonzero entry (for instance $\Delta=\mbox{diag}\{1,0,\cdots,0\}$).
Numerically, I can see that
$$x^T(L+\Delta)x>0$$
But I cannot prove it since both matrices, $\mathcal{L}$ and $\Delta$ are positive semidefinite.
Any thoughts?
More or less like the solution above, but with less theory.
If $a_{ij}$ is the weight between the vertices $i$, $j$ $$x^t \cdot L \cdot x = \sum_{i<j}a_{ij}(x_i-x_j)^2 \ge 0$$ (we knew that). We can also see for what vectors $x$ we have equality: they lie in the subspace generated by $(x^C)$, where for each $C$ connected component of the graph $x^C$ is (more or less) the characteristic function of that component. If the graph is connected that means $x$ has all components equal.
If $\Delta$ is another positive semidefinite matrix then the kernel of $(L+\Delta)$ is the intersection of the kernels of $L$ and $\Delta$. Now it's easy to see that the intersection is $(0)$ if $\Delta$ is also diagonal and non-zero.