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 Article Faculty Publications -Articles 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 Centrality-based graph entropy and sensitivity analysis of n-inordinate invariant intersection graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550083; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500831" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500831</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105007329302?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007329302?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 Centrality is a real-valued function on the vertex set of a graph that helps in determining the vitality of its vertices. Graph entropy gives the structural information of complex networks, based on some information of the network entities. An algebraic intersection graph called the n-inordinate invariant intersection graph has been constructed from the symmetric group and its structural properties are being studied, in the literature. In this paper, we discuss the centrality measures and the graph entropy of the n-inordinate invariant intersection graphs and their complements, and analyze the sensitivity of these networks, based on the centrality measures of their vertices. 2020 World Scientific Publishing Company. Subject The topic of the resource centrality measures; entropy; Invariant intersection graph; n-inordinate invariant intersection graphs; sensitivity analysis Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article 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