Main functions and the spectrum of super graphs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Arunkumar, G., Cameron, Peter J., Ganeshbabu, R., Nath, Rajat Kanti
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911169960214528
author Arunkumar, G.
Cameron, Peter J.
Ganeshbabu, R.
Nath, Rajat Kanti
author_facet Arunkumar, G.
Cameron, Peter J.
Ganeshbabu, R.
Nath, Rajat Kanti
contents Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two distinct vertices $g, h \in G$ are adjacent if $[g] = [h]$ or there exist $x \in [g]$ and $y \in [h]$ such that $x$ and $y$ are adjacent in the A graph of $G$. In this paper, we compute spectrum of equality/conjugacy supercommuting graphs of dihedral/dicyclic groups and show that these graphs are not integral.
format Preprint
id arxiv_https___arxiv_org_abs_2408_00390
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Main functions and the spectrum of super graphs
Arunkumar, G.
Cameron, Peter J.
Ganeshbabu, R.
Nath, Rajat Kanti
Combinatorics
05C50
Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two distinct vertices $g, h \in G$ are adjacent if $[g] = [h]$ or there exist $x \in [g]$ and $y \in [h]$ such that $x$ and $y$ are adjacent in the A graph of $G$. In this paper, we compute spectrum of equality/conjugacy supercommuting graphs of dihedral/dicyclic groups and show that these graphs are not integral.
title Main functions and the spectrum of super graphs
topic Combinatorics
05C50
url https://arxiv.org/abs/2408.00390