Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Ghosh, Sanghita; Gundgurti, Ravindra; Vettiyankal, Abraham Title A name given to the resource Some properties of star-perfect graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Communications in Combinatorics and Optimization;Volume;11;Issue;1;pp.49-56 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.22049/cco.2023.28076.1484" target="_blank" rel="noreferrer noopener">https://doi.org/10.22049/cco.2023.28076.1484</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105019802895?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105019802895?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Ghosh S., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Gundgurti R., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Vettiyankal A., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India Description An account of the resource For a finite simple graph G = (V, E), ?s(G) denotes the minimum number of induced stars contained in G such that the union of their vertex sets is V (G), and ?s(G) denotes the maximum number of vertices in G such that no two are contained in the same induced star of G. We call the graph G star-perfect if ?s(H) = ?s(H), for every induced subgraph H of G. We prove here that no cycle in a star-perfect graph has crossing chords and star-perfect graphs are planar. Also we present a few properties of star perfect graphs. 2026 Azarbaijan Shahid Madani University. Subject The topic of the resource crossing chords; planar graph; star-perfect graphs; total graphs Publisher An entity responsible for making the resource available Azarbaijan Shahid Madani University Relation A related resource ISSN: 25382128; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online