Abstract
Considering a graph of order , a generalized -join operation of a family of graphs , constrained by a family of vertex subsets , is introduced. When each vertex subset is -regular, it is deduced that all non-main adjacency eigenvalues of , different from , for remain as eigenvalues of the graph obtained by the above mentioned operation. Furthermore, if each graph of the family is -regular, for , and all the vertex subsets are such that , the -generalized join operation constrained by these vertex subsets coincides with the -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 with spread equals is introduced.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.