On path-induced signed graphs

Title

On path-induced signed graphs

Creator

Kottarathil, Jomon; Naduvath, Sudev

Description

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.

Source

Acta Universitatis Sapientiae, Mathematica;Volume;18;Issue;1;Article No.;5;

Date

01-01-2026

Publisher

Springer International Publishing

Subject

Balance; Clusterability; Induced signed graphs; Path-induced signed graphs; Signed graphs

Coverage

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

Rights

All Open Access; Gold Open Access

Relation

ISSN: 18446094;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s44426-026-00032-4

https://www.scopus.com/pages/publications/105031517381?origin=resultslist