Color Connections inn-Inordinate Invariant Intersection Graphs
subject: 05C15; 05C25; 05C40; 05C62; Color connections; Intersection graphs; Invariant intersection graphs; n-inordinate invariant intersection graphs; Permutation groups; Rainbow connection
description: Investigating different properties of algebraic graphs is a curious avenue of research in algebraic graph theory, as these algebraic graphs are well-structured classes of graphs. In these lines, various structural properties of the algebraic intersection graph, called the n-inordinate invariant intersection graphs, have been studied in the literature. Color connections in graphs is the assignment of colors or equivalently, labels to the entities of a non-trivial connected graph, whose protocols are defined based on the connectivity aspects. In this article, we study the different color connections in the n-inordinate invariant intersection graphs and their complements, called the n-inordinate invariant non-intersection graphs. The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
creator: Madhumitha, S.; Naduvath, Sudev
source: Trends in Mathematics;Volume;Part F1273;pp.151-163
publisher: Springer Science and Business Media Deutschland GmbH
date: 01-01-2026
rights: Restricted Access; Hardcopy may be available in the library
relation: ISSN: 22970215;
language: English
type: Book chapter
coverage: Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India