Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/5215Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mehatari, Ranjit | - |
| dc.date.accessioned | 2025-07-14T07:09:29Z | - |
| dc.date.available | 2025-07-14T07:09:29Z | - |
| dc.date.issued | 2025-06 | - |
| dc.identifier.citation | Conference on Theoretical and Computational Algebra (TCA), University of Evora, Portugal, 29 June-3 July 2025 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2080/5215 | - |
| dc.description | Copyright belongs to the proceeding publisher. | en_US |
| dc.description.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. | en_US |
| dc.subject | Power graph | en_US |
| dc.subject | Induced subgraph | en_US |
| dc.subject | Cograph | en_US |
| dc.subject | Nilpotent group | en_US |
| dc.title | On P4-Free Power Graphs | en_US |
| dc.type | Presentation | en_US |
| Appears in Collections: | Conference Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2025_TCA_RMehatari_On P4.pdf | Presentation | 298.15 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.