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 G1,..., Gp, constrained by a family of vertex subsets Si ⊂eq V(Gi), i=1,..., p, is introduced. When each vertex subset Si is (ki,τi)-regular, it is deduced that all non-main adjacency eigenvalues of Gi, different from ki-τi, for i=1,..., p, remain as eigenvalues of the graph G obtained by the above mentioned operation. Furthermore, if each graph Gi of the family is ki-regular, for i=1,..., p, and all the vertex subsets are such that Si=V(Gi), 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…