Coalition partitions of n-inordinate invariant intersection graphs
- Title
- Coalition partitions of n-inordinate invariant intersection graphs
- Creator
- Madhumitha, S.; Naduvath, Sudev
- Description
- A class of algebraic intersection graphs, called the n-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in graphs has been recently introduced based on different types of domination in graphs. In this article, we analyse the structure of the n-inordinate invariant intersection graphs by investigating certain variants of domination based coalition partitions of them. 2025 World Scientific Publishing Company.
- Source
- Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550073;
- Date
- 01-01-2025
- Publisher
- World Scientific
- Subject
- coalition; domination; Invariant intersection graphs; n-inordinate invariant intersection graphs; symmetric groups
- Coverage
- Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
- Rights
- Restricted Access; Hardcopy may be available in the library
- Relation
- ISSN: 17938309;
- Format
- online
- Language
- English
- Type
- Article
Collection
Citation
Madhumitha, S.; Naduvath, Sudev, “Coalition partitions of n-inordinate invariant intersection graphs,” CHRIST (Deemed To Be University) Institutional Repository, accessed June 18, 2026, https://archives.christuniversity.in/items/show/23042.
