惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Recent Announcements
Recent Announcements
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
Engineering at Meta
Engineering at Meta
Stack Overflow Blog
Stack Overflow Blog
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
aimingoo的专栏
aimingoo的专栏
I
InfoQ
B
Blog
WordPress大学
WordPress大学
Jina AI
Jina AI
小众软件
小众软件
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园_首页
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
酷 壳 – CoolShell
酷 壳 – CoolShell
阮一峰的网络日志
阮一峰的网络日志
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
G
Google Developers Blog
C
Check Point Blog
月光博客
月光博客
L
LangChain Blog
GbyAI
GbyAI

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On the deep commuting graph of a finite group
Sumana Hatui, Sanjay Mukherjee, Kamal Lochan Patra · 2025-11-17 · via math.CO updates on arXiv.org

Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $Δ_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$. The deep commuting graph of a finite group was first introduced in [P. J. Cameron and B. Kuzma, Between the enhanced power graph and the commuting graph, {\it J. Graph Theory} {\bf 102} (2023), no. 2, 295--303], where the authors have shown that $Δ_D(G)$ is fixed irrespective of the choice of the Schur cover $\tilde{G}$. In this paper, we first prove that $Δ_D(G)$ is complete if and only if $G$ is cyclic. Also, we classify finite simple groups, symmetric groups and alternating groups, for which $Δ_D(G)$ is perfect. In addition, explore several other properties of $Δ_D(G)$ like Eulerianess, universality and connectedness of reduced deep commuting graphs. Next, we classify the finite abelian groups for which deep commuting graphs coincide with enhance power graphs. We also characterize the dominant vertices for the deep commuting graphs of finite abelian groups and examine the connectedness of the associated reduced deep commuting graphs. These properties of the deep commuting graphs for the non abelian groups like symmetric groups, alternating groups, dihedral groups, generalized quaternion group and Heisenberg groups are also discussed.