Search

The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\overline{G}) = |E(\overline{G})| \leq \lfloor n/2 \rfloor -1$ have $q(G)=2$. We conjecture that any $G$ with $e(\overline{G}) \leq n-3$ satisfies $q(G) = 2$. We show that this conjecture is true if $\overline{G}$ is bipartite and in other sporadic cases. Furthermore, we characterize $G$ with $\overline{G}$ bipartite and $e(\overline{G}) = n-2$ for which $q(G) > 2$. more...

For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for $i\neq j$, $a_{ij}=0$ if and only if $\{i,j\}$ is not an edge of $G$. Let $q(G)={\rm min}\{q(A)\,:\,A \in \mathcal{S}(G)\}$. Studying $q(G)$ has become a fundamental sub-problem of the inverse eigenvalue problem for graphs, and characterizing the case for which $q(G)=2$ has been especially difficult. This paper considers the problem of determining the regular graphs $G$ that satisfy $q(G)=2$. The resolution is straightforward if the degree of regularity is $1, 2,$ or $3$. However, the $4$-regular graphs with $q(G)=2$ are much more difficult to characterize. A connected $4$-regular graph has $q(G)=2$ if and only if either $G$ belongs to a specific infinite class of graphs, or else $G$ is one of fifteen $4$-regular graphs whose number of vertices ranges from $5$ to $16$. This technical result gives rise to several intriguing questions., Comment: AMS subject classification: 05C50, 15A29, 15A18 more...

The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. It is shown that the minimum number of edges necessary for a connected graph $G$ to have $q(G)=2$ is $2n-4$ if $n$ is even, and $2n-3$ if $n$ is odd. In addition, a characterization of graphs for which equality is achieved in either case is given., Comment: 13 pages more...

Rubalcaba and Slater (Robert R. Rubalcaba and Peter J. Slater. Efficient (j,k)-domination. Discuss. Math. Graph Theory, 27(3):409-423, 2007.) define a $(j,k)$-dominating function on graph $X$ as a function $f:V(X)\rightarrow \{0,\ldots,j\}$ so that for each $v\in V(X)$, $f(N[v])\geq k$, where $N[v]$ is the closed neighbourhood of $v$. Such a function is efficient if all of the vertex inequalities are met with equality. They give a simple necessary condition for efficient domination, namely: if $X$ is an $r$-regular graph on $n$ vertices that has an efficient $(1,k)$-dominating function, then the size of the corresponding dominating set divides $n\cdot k$. The Hamming graph $H(q,d)$ is the graph on the vectors $\mathbb{Z}_q^d$ where two vectors are adjacent if and only if they are at Hamming distance $1$. We show that if $q$ is prime, then the previous necessary condition is sufficient for $H(q,d)$ to have an efficient $(1,k)$-dominating function. This result extends a result of Lee (Jaeun Lee. Independent perfect domination sets in Cayley graphs. J. Graph Theory, 37(4):213-219, 2001.) on independent perfect domination in Cayley graphs. We mention difficulties that arise for $H(q,d)$ when $q$ is a prime power but not prime., Comment: 11 pages, 1 figure more...

A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \ldots, n$ and $p_i^Tp_j \le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of $G$ is the smallest real number $t \ge 1$ for which a vector $t$-coloring of $G$ exists. For a graph $H$ and a vector $t$-coloring $p_1,\ldots,p_n$ of a graph $G$, the assignment $(i,\ell) \mapsto p_i$ is a vector $t$-coloring of the categorical product $G \times H$. It follows that the vector chromatic number of $G \times H$ is at most the minimum of the vector chromatic numbers of the factors. We prove that equality always holds, constituting a vector coloring analog of the famous Hedetniemi Conjecture from graph coloring. Furthermore, we prove a necessary and sufficient condition for when all of the optimal vector colorings of the product can be expressed in terms of the optimal vector colorings of the factors. The vector chromatic number is closely related to the well-known Lov\'{a}sz theta function, and both of these parameters admit formulations as semidefinite programs. This connection to semidefinite programming is crucial to our work and the tools and techniques we develop could likely be of interest to others in this field., Comment: 38 pages more...

In this paper we study the existence of homomorphisms $G\to H$ using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest real number $t \ge 2$ for which there exists an assignment of unit vectors $i\mapsto p_i$ to its vertices such that $\langle p_i, p_j\rangle\le -1/(t-1),$ when $i\sim j$. Our approach allows to reprove, without using the Erd\H{o}s-Ko-Rado Theorem, that for $n>2r$ the Kneser graph $K_{n:r}$ and the $q$-Kneser graph $qK_{n:r}$ are cores, and furthermore, that for $n/r = n'/r'$ there exists a homomorphism $K_{n:r}\to K_{n':r'}$ if and only if $n$ divides $n'$. In terms of new applications, we show that the even-weight component of the distance $k$-graph of the $n$-cube $H_{n,k}$ is a core and also, that non-bipartite Taylor graphs are cores. Additionally, we give a necessary and sufficient condition for the existence of homomorphisms $H_{n,k}\to H_{n',k'}$ when $n/k = n'/k'$. Lastly, we show that if a 2-walk-regular graph (which is non-bipartite and not complete multipartite) has a unique optimal vector coloring, it is a core. Based on this sufficient condition we conducted a computational study on Ted Spence's list of strongly regular graphs and found that at least 84% are cores. more...

An embedding $i \mapsto p_i\in \mathbb{R}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mathbb{R}^{k}$ satisfying $q_i^T q_j = p_i^T p_j$ for $i = j$ and $i$ adjacent to $j$, there exists an isometry mapping the $q_i$'s to the $p_i$'s for all $ i\in V(G)$. The notion of universal completability was introduced recently due to its relevance to the positive semidefinite matrix completion problem. In this work we focus on graph embeddings constructed using the eigenvectors of the least eigenvalue of the adjacency matrix of $G$, which we call least eigenvalue frameworks. We identify two necessary and sufficient conditions for such frameworks to be universally completable. Our conditions also allow us to give algorithms for determining whether a least eigenvalue framework is universally completable. Furthermore, our computations for Cayley graphs on $\mathbb{Z}_2^n \ (n \le 5)$ show that almost all of these graphs have universally completable least eigenvalue frameworks. In the second part of this work we study uniquely vector colorable (UVC) graphs, i.e., graphs for which the semidefinite program corresponding to the Lov\'asz theta number (of the complementary graph) admits a unique optimal solution. We identify a sufficient condition for showing that a graph is UVC based on the universal completability of an associated framework. This allows us to prove that Kneser and $q$-Kneser graphs are UVC. Lastly, we show that least eigenvalue frameworks of 1-walk-regular graphs always provide optimal vector colorings and furthermore, we are able to characterize all optimal vector colorings of such graphs. In particular, we give a necessary and sufficient condition for a 1-walk-regular graph to be uniquely vector colorable., Comment: 25 pages more...

Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems on circulant graphs. \emph{Linear Algebra Appl.}, 285(1-3): 123--142, 1998) showed that computing clique number and chromatic number are still NP-Hard problems for the class of circulant graphs. We show that computing clique number is NP-Hard for the class of Cayley graphs for the groups $G^n$, where $G$ is any fixed finite group (e.g., cubelike graphs). We also show that computing chromatic number cannot be done in polynomial time (under the assumption $\text{P}\neq \text{NP}$) for the same class of graphs. Our presentation uses free Cayley graphs. The proof combines free Cayley graphs with quotient graphs and Goppa codes., Comment: 27 pages more...