Abstract
Like Cayley graphs, G-graphs are graphs that are constructed from groups but they correspond to alternative constructions. The purpose of this article is to study the connection between these two types of graphs. Such a connection opens up a possible pathway between these two theories and thus investigating certain problems from one of these areas might be easier to tackle when dealt with them as problems in the other. First, we show the existence of a link that connects classes of these two types of graphs, and then we investigate the implications of this result on certain open problems in the theory of Cayley graphs. In particular, we show that computing the spectra of a certain infinite family of Cayley graphs can be easily realized via the use of G-graphs. In the process, general results concerning G-graphs and the spectra of a hypergraph are presented. Finally, we use a certain graph operation to present a new alternative tool for constructing integral graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
