Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5215
Title: On P4-Free Power Graphs
Authors: Mehatari, Ranjit
Keywords: Power graph
Induced subgraph
Cograph
Nilpotent group
Issue Date: Jun-2025
Citation: Conference on Theoretical and Computational Algebra (TCA), University of Evora, Portugal, 29 June-3 July 2025
Abstract: Let G be a finite group. The power graph of G, denoted by P(G), is a graph whose vertex set is G, and two vertices in P(G) are connected by an edge if and only if one of them is a power of another. We start by going over some properties of power graphs. Then we characterize finite groups with no induced subgraphs isomorphic to a path on four vertices.
Description: Copyright belongs to the proceeding publisher.
URI: http://hdl.handle.net/2080/5215
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2025_TCA_RMehatari_On P4.pdfPresentation298.15 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.