Generating graphs of finite dihedral groups

DOI10.1007/S00025-023-01963-XMaRDI QIDQ6136239zbMATH OpenOpenAlexFDO

Authors A. Satyanarayana Reddy, Kavita Samant

Publication date 29 August 2023

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2307.11802

zbMATH Keywords

adjacency matrixgenerating graphsLaplacian matrixspectrumtopological indices

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Chemical graph theory (05C92) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

A group \(G\) is said to be two generated if there exists a pair of elements that generates \(G\). The generating graph of \(G\), denoted by \(\Gamma(G)\), is a graph whose vertex set is \(G\), and any two distinct vertices are adjacent if they generate \(G\). It is natural to consider only two generated groups; otherwise, the generating graphs are empty graphs. The basic idea behind generating graphs is the generation of groups by two of its elements, which was first studied from a probabilistic perspective. The authors here probe the generating graph of \(D_n\), where \(D_n\) is a dihedral group of order \(2n\). They explore various graph-theoretic properties and determine the complete spectrum of the adjacency and the Laplacian matrix of \(\Gamma(D_n)\). They also compute some distance and degree-based topological indices of \(\Gamma(D_n)\).

Recommendations

• On a special quotient of the generating graph of a finite group
• Power graphs of finite groups of even order
• On the non-commuting graph of dihedral group
• The cyclic graph of a finite group.
• Forbidden subgraphs in generating graphs of finite groups

Cites work

• Crowns and factorization of the probabilistic zeta function of a finite group.
• Energy and Wiener index of zero-divisor graphs
• Finite groups with planar generating graph
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• On the clique number of the generating graph of a finite group
• Probabilistic generation of finite simple groups
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• Some distance-based topological indices of a non-commuting graph
• Some results and questions related to the generating graph a finite group.
• Spectra of graphs resulting from various graph operations and products: a survey
• The diameter of the generating graph of a finite soluble group
• The generating graph of finite soluble groups.
• Topological indices of the non-commuting graph for generalised quaternion group

Cited in

(5)

• The independence and clique polynomials of the center graphs of some finite groups
• Singular graphs with dihedral group action
• On a special quotient of the generating graph of a finite group
• The dihedral-type adjacency sequences
• Generating graphs of some solvable groups

This page was built for publication: Generating graphs of finite dihedral groups

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