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 Poovathingal, Agnes; Kureethara, Joseph Varghese Title A name given to the resource A STUDY ON PERFECT ITALIAN DOMINATION OF GRAPHS AND THEIR COMPLEMENTS 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 Ural Mathematical Journal;Volume;11;Issue;1;pp.104-113 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.15826/umj.2025.1.007" target="_blank" rel="noreferrer noopener">https://doi.org/10.15826/umj.2025.1.007</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105012559878?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105012559878?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 Poovathingal A., Christ University, Karnataka, Bangalore, 560029, India, Christ College (Autonomous), Christ Nagar, Kerala, Irinjalakuda, 680125, India; Kureethara J.V., Christ University, Karnataka, Bangalore, 560029, India, Kuriakose Elias College, Kottayam, Kerala, Mannanam, 686561, India Description An account of the resource Perfect Italian Domination is a type of vertex domination which can also be viewed as a graph labelling problem. The vertices of a graph G are labelled by 0, 1 or 2 in such a way that a vertex labelled 0 should have a neighbourhood with exactly two vertices in it labelled 1 each or with exactly one vertex labelled 2. The remaining vertices in the neighbourhood of the vertex labelled 0 should be all 0s. The minimum sum of all labels of the graph G satisfying these conditions is called its Perfect Italian domination number. We study the behaviour of graph complements and how the Perfect Italian Domination number varies between a graph and its complement. The NordhausGaddum type inequalities in the Perfect Italian Domination number are also discussed. 2025, Krasovskii Institute of Mathematics and Mechanics. All rights reserved. Subject The topic of the resource Graph complement; NordhausGaddum type inequalities; Perfect Italian domination Publisher An entity responsible for making the resource available Krasovskii Institute of Mathematics and Mechanics Relation A related resource ISSN: 24143952; 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 All Open Access; Gold Open Access; Green Open Access Format The file format, physical medium, or dimensions of the resource online