English

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

Combinatorics 2012-05-09 v1

Abstract

Considering a graph HH of order pp, a generalized HH-join operation of a family of graphs G1,...,GpG_1,..., G_p, constrained by a family of vertex subsets SiV(Gi)S_i \subseteq V(G_i), i=1,...,p,i=1,..., p, is introduced. When each vertex subset SiS_i is (ki,τi)(k_i,\tau_i)-regular, it is deduced that all non-main adjacency eigenvalues of GiG_i, different from kiτik_i-\tau_i, for i=1,...,p,i=1,..., p, remain as eigenvalues of the graph GG obtained by the above mentioned operation. Furthermore, if each graph GiG_i of the family is kik_i-regular, for i=1,...,pi=1,..., p, and all the vertex subsets are such that Si=V(Gi)S_i=V(G_i), the HH-generalized join operation constrained by these vertex subsets coincides with the HH-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 nn with spread equals nn is introduced.

Keywords

Cite

@article{arxiv.1205.1752,
  title  = {Eigenvalues of a H-generalized join graph operation constrained by vertex subsets},
  author = {Domingos M. Cardoso and Enide A. Martins and Maria Robbiano and Oscar Rojo},
  journal= {arXiv preprint arXiv:1205.1752},
  year   = {2012}
}

Comments

15 pages, 1 figure

R2 v1 2026-06-21T21:00:19.919Z