The independence graph of a finite group

preprint2020arXivOpen access

Abstract

Given a finite group G,G, we denote by Δ(G)Δ(G) the graph whose vertices are the elements GG and where two vertices xx and yy are adjacent if there exists a minimal generating set of GG containing xx and y.y. We prove that Δ(G)Δ(G) is connected and classify the groups GG for which Δ(G)Δ(G) is a planar graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.