Disconnected Character graphs and odd Dominating sets

DOI10.1080/00927872.2021.1894437MaRDI QIDQ6336256arXivFDO

Authors Mahdi Ebrahimi

Publication date 5 March 2020

Published in arXiv

Full work available at URL https://doi.org/10.1080/00927872.2021.1894437

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ordinary representations and characters (20C15)

arXiv classification

math.COmath.GR

Abstract: Suppose $Gamma$ is a finite simple graph. If $D$ is a dominating set of $Gamma$ such that each $xinD$ is contained in the set of vertices of an odd cycle of $Gamma$, then we say that $D$ is an odd dominating set for $Gamma$. For a finite group $G$, let $Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we show that the complement of $Delta(G)$ contains an odd dominating set, if and only if $Delta(G)$ is a disconnected graph with non-bipartite complement.

This page was built for publication: Disconnected Character graphs and odd Dominating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6336256)