On path-induced signed graphs
Abstract
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.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Complexity and Algorithms in Graphs
Publication details
- Journal / source
- Acta Universitatis Sapientiae Mathematica
- Publisher
- Springer Science and Business Media LLC
- Volume
- 18
- Issue
- 1
- Publication date
- 27 February 2026
- Language
- EN