.png){kind=icon}
.png){kind=icon}
Return
On path-induced signed graphs
.png){kind=icon}
PRE
AI
DOI：10.1007/s44426-026-00032-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Signed graphs
Induced signed graphs
Path-induced signed graphs
Balance
Clusterability
Journal
A
IF:
0.6
Papers:
30
Citations:
0