当前位置: X-MOL 学术Commun. Algebra › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Disconnected character graphs and odd dominating sets
Communications in Algebra ( IF 0.7 ) Pub Date : 2021-03-13 , DOI: 10.1080/00927872.2021.1894437
Mahdi Ebrahimi 1
Affiliation  

Abstract

Suppose Γ is a finite simple graph. If D is a dominating set of Γ such that each xD is contained in the set of vertices of an odd cycle of Γ, then we say that D is an odd dominating set for Γ. For a finite group G, let Δ(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 Δ(G) contains an odd dominating set, if and only if Δ(G) is a disconnected graph with non-bipartite complement.



中文翻译:

断开的字符图和奇数支配集

摘要

假设 Γ 是一个有限的简单图。如果D是 Γ 的支配集,使得每个XD包含在 Γ 的奇周期的顶点集中,那么我们说D是 Γ 的奇支配集。对于有限群G,令Δ(G)表示建立在G的不可约复字符的度集上的字符图。在本文中,我们证明了Δ(G) 包含奇支配集,当且仅当 Δ(G) 是具有非二部补集的断开图。

更新日期:2021-03-13
down
wechat
bug