Nonsplit graphs with split maximal edge induced subgraphs
A split graph is a graph in which the vertices can be partitioned into an independent set and a clique. We show that every nonsplit graph has at most four split maximal proper edge induced subgraphs. The exhaustive list of fifteen classes of nonsplit graphs having a split maximal proper edge induced subgraph is determined in this paper.
Authors
- S. Monikandan (ORCID: https://orcid.org/0000-0001-9805-2914)
- Venugopal Manikandan
Publication Details
- Journal
- Ars Combinatoria
- Published
- 2025-09-30
- DOI
- https://doi.org/10.61091/ars164-09
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Board for Higher Mathematics