Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Book Chapter Faculty Publications- Book Chapter Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Madhumitha, S.; Naduvath, Sudev Title A name given to the resource Color Connections inn-Inordinate Invariant Intersection Graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Trends in Mathematics;Volume;Part F1273;pp.151-163 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/978-3-032-04418-1_13" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-3-032-04418-1_13</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105026767732?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105026767732?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India Description An account of the resource 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. Subject The topic of the resource 05C15; 05C25; 05C40; 05C62; Color connections; Intersection graphs; Invariant intersection graphs; n-inordinate invariant intersection graphs; Permutation groups; Rainbow connection Publisher An entity responsible for making the resource available Springer Science and Business Media Deutschland GmbH Relation A related resource ISSN: 22970215; Language A language of the resource English Type The nature or genre of the resource Book chapter Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online