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 Kottarathil, Jomon; Naduvath, Sudev Title A name given to the resource On path-induced signed 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 Acta Universitatis Sapientiae, Mathematica;Volume;18;Issue;1;Article No.;5; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/s44426-026-00032-4" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s44426-026-00032-4</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105031517381?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105031517381?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 Kottarathil J., Department of Mathematics, St. Josephs College (Autonomous), Devagiri, Kerala, Kozhikode, 673008, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource The path decomposition of a graph G is the process of decomposing it into edge-disjoint paths. An induced signed graph is a signed graph formed from an ordinary unsigned graph by assigning signs to its edges according to some protocol. In this paper, we introduce the notion of a path-induced signed graph as an induced signed graph whose edges receive a sign according to whether its end vertices are the end vertices of a path in a path decomposition of G. We also discuss some characteristics of this type of signed graph. The Author(s), under exclusive license to Sapientia Hungarian University of Transylvania 2026. Subject The topic of the resource Balance; Clusterability; Induced signed graphs; Path-induced signed graphs; Signed graphs Publisher An entity responsible for making the resource available Springer International Publishing Relation A related resource ISSN: 18446094; 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 Format The file format, physical medium, or dimensions of the resource online