Engel and co-Engel graphs of finite groups

This paper investigates the structural and spectral properties of Engel and co-Engel graphs associated with finite groups, establishing that the undirected Engel graph does not uniquely determine its directed counterpart, characterizing isolated vertices via the Fitting subgroup, and computing topological and spectral invariants to classify non-Engel groups with specific graph-theoretic constraints.

The Gist

Imagine a giant party where every guest is a number or a symbol from a mathematical "group." In this party, people interact based on a specific rule: how well they can "undo" each other's actions.

This paper is a study of the social dynamics of these mathematical parties. The authors, a team of mathematicians, are mapping out who gets along, who clashes, and what the overall "shape" of the party looks like. They use tools from Graph Theory (the study of maps and connections) to visualize these interactions.

Here is the breakdown of their research in simple terms:

1. The Core Concept: The "Engel" Dance

In this mathematical world, two guests, let's call them Alice and Bob, have a special dance move.

• The Rule: Alice tries to undo Bob's move, then Bob tries to undo Alice's, and they keep swapping turns.
• The Goal: If, after a certain number of turns, they end up back at the starting position (the "identity"), they are considered "Engel-compatible."
• The Graph: The authors draw a map (a graph) where:
  • Points (Vertices): Every guest at the party.
  • Lines (Edges): A line connects two guests if they fail to get back to the start after dancing. In other words, they are "clashing" or "non-commuting."

The paper focuses on the Co-Engel Graph. Think of this as a map of the drama. If two people are connected by a line, it means they have a persistent conflict that never resolves, no matter how many times they try to fix it.

2. The "Quiet Zone" vs. The "Drama Zone"

Not everyone at the party is involved in drama.

• The Fitting Subgroup (The Quiet Zone): There is a special group of guests who are so well-behaved that they never cause a conflict with anyone. In the "drama map," these people are isolated. They stand alone in the corner, not connected to anyone.
• The Study Focus: The authors decided to ignore the quiet zone because it's boring. They cut out the isolated guests and only studied the Drama Zone (the part of the graph where everyone is connected to someone). They call this the "reduced" graph.

3. What They Discovered

A. The Shape of the Party (Topology)

The authors asked: "What does the shape of this drama map look like?"

• Flat (Planar): Can you draw the map on a piece of paper without any lines crossing?
• Donut-shaped (Toroidal): Do you need a donut (a torus) to draw it without crossings?
• Projective (Möbius Strip): Do you need a twisted strip of paper (like a Möbius strip) to draw it?

They found that for most "small" groups, the drama map is flat. But as the groups get bigger or more complex, the map gets twisted and requires a donut or even a double-donut to be drawn properly. They calculated exactly which groups create which shapes.

B. The Energy of the Party

In math, graphs have "energy" (a specific calculation based on the connections).

• The Question: Is the party too energetic (chaotic) or too low-energy (boring)?
• The Finding: For the groups they studied, the energy is just right. It's not "hyper-energetic" (wildly chaotic) and not "hypo-energetic" (completely dead). It sits in a sweet spot.

C. The "Twin" Mystery

Usually, if you look at a map of a party (ignoring who is talking to whom, just seeing who is in the room), you can figure out exactly who is talking to whom.

• The Surprise: The authors found two specific sizes of parties (groups of size 54 and 96) where this doesn't work. You can have two different parties that look exactly the same on the "undirected" map, but the actual flow of conversation (the directed map) is different. It's like two different movies having the same cast list but different plots.

4. Why Does This Matter?

You might ask, "Who cares about math parties?"

• Structure: Understanding these graphs helps mathematicians understand the hidden structure of complex systems.
• Predictability: If they know the "drama map" of a group, they can predict how the group behaves. For example, if the map is a simple flat shape, the group is likely "soluble" (easy to break down). If the map is a twisted, complex donut, the group is wild and hard to predict.
• Conjectures: They proved that these graphs follow certain mathematical "laws" (conjectures) regarding their energy and indices, which helps validate broader theories in mathematics.

Summary Analogy

Imagine you are a detective trying to understand a secret society.

1. The Map: You draw a map of who hates whom (the Co-Engel graph).
2. The Filter: You ignore the members who are nice to everyone (the isolated vertices).
3. The Shape: You look at the map. Is it flat? Is it a donut? This tells you how complex the society is.
4. The Energy: You calculate the "vibe" of the group.
5. The Result: The authors showed that for many specific types of societies, you can predict their complexity, their energy, and even prove that their "hate maps" follow strict mathematical rules.

In short, this paper takes a very abstract concept (group theory) and turns it into a visual, geometric story about conflict, structure, and shape, proving that even in the world of pure math, there are patterns waiting to be mapped.

Technical Summary

Here is a detailed technical summary of the paper "Engel and Co-Engel Graphs of Finite Groups" by Peter J. Cameron, Rishabh Chakraborty, Rajat Kanti Nath, and Deiborlang Nongsiang.

1. Problem Statement and Context

The paper investigates the structural and spectral properties of graphs defined on finite groups, specifically focusing on the Engel graph and its complement, the co-Engel graph.

• Definitions:
  • Engel Condition: For elements $x, y$ in a group $G$, the $k$-th Engel commutator is defined inductively as $[x, 1y] = [x, y]$ and $[x, ky] = [[x, k-1y], y]$. The pair $(x, y)$ satisfies the $k$-th Engel condition if $[x, ky] = 1$.
  • Engel Digraph ($\vec{E}(G)$): A directed graph with vertex set $G$ where an arc $x \to y$ exists if $[y, kx] = 1$ for some integer $k$.
  • Engel Graph ($E(G)$): The undirected version of the digraph (ignoring direction).
  • Co-Engel Graph ($E_c(G)$): The complement of the Engel graph. Two vertices $x, y$ are adjacent in $E_c(G)$ if they satisfy the Engel condition in neither order (i.e., $[x, ky] \neq 1$ and $[y, kx] \neq 1$ for all $k$).
• Motivation:
  • The co-Engel graph was previously introduced by Abdollahi under the name "Engel graph," but the authors argue for the current nomenclature to align with standard graph theory conventions (where the complement is often studied).
  • In finite groups, the set of isolated vertices in the co-Engel graph corresponds to the Fitting subgroup $F(G)$ (the set of left Engel elements). Since $F(G)$ is a normal nilpotent subgroup, the authors focus on the induced subgraph $E_c^-(G)$ obtained by removing these isolated vertices.
  • The study aims to characterize non-nilpotent (non-Engel) groups through the topological and spectral properties of $E_c^-(G)$.

2. Methodology

The authors employ a combination of group-theoretic classification, graph theory, and algebraic graph theory techniques:

1. Group-Theoretic Reduction:
   • Utilization of Schmidt's classification of minimal non-nilpotent groups.
   • Analysis of the Fitting subgroup $F(G)$ and the hypercenter $Z_\infty(G)$.
   • Application of the Lexicographic Product of graphs to relate the Engel graph of a group $G$ to that of its quotient $G/Z_\infty(G)$.
2. Graph Construction and Realization:
   • Explicit construction of $E_c^-(G)$ for specific families of groups: Dihedral groups ($D_{2n}$), Generalized Quaternion groups ($Q_{2n}$), and non-abelian groups of order $pq$ ($F_{p,q}$).
   • Proving that for these groups, $E_c^-(G)$ is isomorphic to complete multipartite graphs (e.g., $K_{m \cdot n}$).
3. Topological Analysis:
   • Calculation of the genus ($g(\Gamma)$) and crosscap ($\bar{\gamma}(\Gamma)$) of the resulting graphs.
   • Determining conditions under which the graphs are planar, toroidal, or projective.
4. Spectral and Energy Analysis:
   • Computation of Adjacency, Laplacian, and Signless Laplacian spectra for the realized graphs.
   • Calculation of Energy ($E$), Laplacian Energy ($LE$), and Signless Laplacian Energy ($LE^+$).
   • Verification of the E-LE Conjecture ($E \leq LE$).
5. Topological Indices:
   • Computation of Zagreb indices ($M_1$ and $M_2$) and verification of the Hansen–Vukičević conjecture ($M_2/|e| \geq M_1/|v|$).

3. Key Contributions and Results

A. Structural Properties of Engel Graphs

• Directed vs. Undirected: The paper demonstrates that the undirected Engel graph does not uniquely determine the directed Engel graph up to isomorphism. Counterexamples exist for groups of order 54 and 96.
• Nilpotency Characterization: For a finite soluble group $G$, the following are equivalent:
  1. $G$ is nilpotent.
  2. The nilpotency graph is complete.
  3. The Engel graph is complete.
  4. The nilpotency and Engel graphs are identical.
• Lexicographic Product Structure: The Engel graph of $G$ is isomorphic to the lexicographic product of a complete graph of order $|Z_\infty(G)|$ and the Engel graph of $G/Z_\infty(G)$. This allows reduction to groups with trivial centers.

B. Realization of $E_c^-(G)$ as Complete Multipartite Graphs

The authors prove that for specific non-Engel groups, the co-Engel graph (minus isolated vertices) is a complete multipartite graph:

• Dihedral/Quaternion Groups: For $G = D_{2^{t+1}m}$ or $Q_{2^{t+1}m}$ (where $m$ is odd), $E_c^-(G) \cong K_{m \cdot 2^t}$.
• Groups of Order $pq$: For $G = F_{p,q}$ (non-abelian of order $pq$), $E_c^-(G) \cong K_{q \cdot (p-1)}$.
• Direct Products: If $H$ is an Engel group and $G$ is a non-Engel group with $E_c^-(G) \cong K_{m \cdot n}$, then $E_c^-(H \times G) \cong K_{lm \cdot n}$ where $l = |H|$.

C. Topological Characterization (Genus and Crosscap)

The paper characterizes finite non-Engel groups based on the genus of their co-Engel graphs:

• Planar Graphs: $E_c^-(G)$ is planar if and only if $G \cong D_6, D_{12}, Q_{12}$ (recovering a result by Abdollahi).
• Toroidal Graphs: The authors determine exactly which groups yield toroidal graphs (genus 1). For example, $D_{2m}$ yields a toroidal graph if $m=5$ or $7$.
• Projective Graphs: $E_c^-(G)$ is projective (crosscap 1) if and only if $G \cong D_6, D_{12}, Q_{12}$.
• Bounded Clique Number: The paper determines all finite non-Engel groups with clique number $\omega(E_c^-(G)) \leq 4$ that are toroidal or projective.

D. Spectral and Energy Results

• Spectra: Explicit formulas are derived for the spectra of $E_c^-(G)$ for the identified families.
• Energy Bounds: The authors prove that for the groups considered, $E_c^-(G)$ is neither hyperenergetic nor hypoenergetic.
  • $E(E_c^-(G)) < E(K_{|V|})$ (Not hyperenergetic).
  • $E(E_c^-(G)) > |V|$ (Not hypoenergetic).
• Conjecture Verification:
  • E-LE Conjecture: The paper confirms that $E(E_c^-(G)) \leq LE(E_c^-(G))$ holds for all groups studied.
  • Hansen–Vukičević Conjecture: The inequality $\frac{M_2}{|e|} \geq \frac{M_1}{|v|}$ is proven to hold for $E_c^-(G)$ in the cases of Dihedral, Quaternion, and $F_{p,q}$ groups.

4. Significance

• Unification of Concepts: The paper clarifies the relationship between the directed and undirected versions of Engel graphs, highlighting that the directed structure contains information lost in the undirected projection.
• Topological Classification: It provides a complete classification of small non-Engel groups based on the topological embedding of their co-Engel graphs, linking group structure (nilpotency, order, subgroup structure) directly to graph genus.
• Validation of Conjectures: By verifying the E-LE and Hansen–Vukičević conjectures for these specific graph families, the paper contributes to the broader understanding of the relationship between algebraic graph invariants and group-theoretic properties.
• Methodological Framework: The use of lexicographic products and the reduction to $G/Z_\infty(G)$ provides a powerful tool for analyzing Engel graphs of more complex groups by reducing them to groups with trivial centers.

In summary, this work bridges finite group theory and algebraic graph theory, offering precise structural descriptions, topological classifications, and spectral characterizations of co-Engel graphs for a wide class of finite non-nilpotent groups.