2021•Journal of Physics Conference SeriesOpen access

Some classes of Trivially Perfect Graphs

Ganesh Gandal, R. Mary Jeya Jothi

Abstract

Abstract A graph G is supposed to be trivially perfect if, in each induced subgraph H of G, the number of maximal cliques in H equivalents to the size of a maximum independent set in H. Trivially perfect graphs is subclasses of notable perfect graphs and its characterization have numerous continuous applications and it is adequate to research its subclasses. Along with this idea, in this paper, it is discussed trivially perfect graphs on the windmill graph and demonstrated a few outcomes on trivially perfect graphs.

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Trivially perfect graph, Perfect graph theorem, Strong perfect graph theorem, Combinatorics, Split graph, Chordal graph, Mathematics, Perfect graph