Search arXivSearch

arXiv · 1205.1752

Eigenvalues of a H-generalized join graph operation constrained by vertex subsets

Abstract

Considering a graph $H$ of order $p$, a generalized $H$-join operation of a family of graphs $G_1,..., G_p$, constrained by a family of vertex subsets $S_i \subseteq V(G_i)$, $i=1,..., p,$ is introduced. When each vertex subset $S_i$ is $(k_i,τ_i)$-regular, it is deduced that all non-main adjacency eigenvalues of $G_i$, different from $k_i-τ_i$, for $i=1,..., p,$ remain as eigenvalues of the graph $G$ obtained by the above mentioned operation. Furthermore, if each graph $G_i$ of the family is $k_i$-regular, for $i=1,..., p$, and all the vertex subsets are such that $S_i=V(G_i)$, the $H$-generalized join operation constrained by these vertex subsets coincides with the $H$-generalized join operation. Some applications on the spread of graphs are presented. Namely, new lower and upper bounds are deduced and a infinity family of non regular graphs of order $n$ with spread equals $n$ is introduced.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Domingos M. Cardoso, Enide A. Martins, Maria Robbiano, Oscar Rojo. 2012-05-08. Eigenvalues of a H-generalized join graph operation constrained by vertex subsets. https://arxiv.org/abs/1205.1752

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO