Color Connections inn-Inordinate Invariant Intersection Graphs
05C15; 05C25; 05C40; 05C62; Color connections; Intersection graphs; Invariant intersection graphs; n-inordinate invariant intersection graphs; Permutation groups; Rainbow connection
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.
Trends in Mathematics;Volume;Part F1273;pp.151-163
Springer Science and Business Media Deutschland GmbH
Restricted Access; Hardcopy may be available in the library
https://doi.org/10.1007/978-3-032-04418-1_13 https://www.scopus.com/pages/publications/105026767732?origin=resultslist
Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India