Characterizing finite nilpotent groups associated with a graph theoretic equality

DOI10.1007/S11587-021-00655-4MaRDI QIDQ6964840zbMATH OpenFDO

Authors Ramesh Prasad Panda, Kamal L. Patra, Binod K. Sahoo

Publication date 4 July 2025

Published in Ricerche di Matematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11587-021-00655-4

zbMATH Keywords

minimum degreenilpotent grouppower graphvertex connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Finite nilpotent groups, (p)-groups (20D15)

Cites work

• A combinatorial characterization of finite groups of prime exponent
• Cayley Graphs with Neighbor Connectivity One
• Certain properties of the power graph associated with a finite group.
• Directed graphs and combinatorial properties of semigroups
• scientific article; zbMATH DE number 4200233 (Why is no real title available?)
• scientific article; zbMATH DE number 1522659 (Why is no real title available?)
• Minimal cut-sets in the power graphs of certain finite non-cyclic groups
• On the chromatic number of the power graph of a finite group
• On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups
• Perfect commuting graphs
• Some applications of graph theory to finite groups
• The commuting graph of bounded linear operators on a Hilbert space
• The power graph of a finite group. II.
• Undirected power graphs of semigroups

Cited in

(1)

• Characterizations of p-groups whose power graphs satisfy certain connectivity conditions

This page was built for publication: Characterizing finite nilpotent groups associated with a graph theoretic equality

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