On path-induced signed graphs
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.\N\NTwo vertices of a signed graph \(S\) are said to be of the same parity if both are either positive or negative simultaneously. If the two vertices differ in signs, then they are said to be of different parity. If every edge of a signed graph is positive, then it is called an all-positive signed graph, and if every edge of a signed graph is negative, then it is called an all-negative signed graph. A signed graph is homogeneous if it is either all-positive or all-negative. The signed graph \(S\) is clusterable if the vertex set \(V(S)\) can be partitioned in such a way that the vertices connecting positive edges lie in the same partition and the vertices connecting negative edges lie in distinct partitions. It is said to be \(k\)-clusterable if \(V(S)\) can be partitioned into \(k\) sets.\N\NA path decomposition of a graph \(G\) is a collection of its edge-disjoint subgraphs such that every edge of \(G\) belongs to exactly one of its subgraphs. Consider a path decomposition of a graph. A terminus or a terminal vertex of \(G\) is a vertex that is an end vertex of a path in the path decomposition of \(G\).\N\NFor a study on balanced path-induced signed graphs of complete bipartite graphs and wheel graphs, see [\textit{J. Kottarathil}, Jordan J. Math. Stat. 16, No. 3, 431--443 (2023; Zbl 1538.05115)].\N\NHere, authors 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\). They also discuss some characteristics of this type of signed graph.\N\NThe paper contains nice and interesting results. It is helpful to researchers working on signed graphs and their allied areas.
- A study on integer additive set-valuations of signed graphs
- A study on the pendant number of graph products
- Graph theory and decomposition
- Induced signed graphs of some classes of graphs
- On pseudo-balancing of path-induced signed graphs
- Recent advancements in graph theory
- Selfipendant and extremal pendant graphs
- Set-valuations of a signed digraph
- Signed graphs
- Signed Graphs and Geometry
- Some new results on colour-induced signed graphs
This page was built for publication: On path-induced signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227133)
