Bidirected Graphs I: Signed General Kotzig-Lov\'asz Decomposition
Nanao Kita

TL;DR
This paper introduces a new connectivity theory for bidirected graphs, generalizing strong components and Kotzig-Lovász decomposition, with implications for factor theory and a novel understanding of their internal structure.
Contribution
It establishes an analogue of strong connectivity for bidirected graphs, defining circular connectivity and components, and extends Kotzig-Lovász decomposition to this context.
Findings
Defines circular connectivity and components for bidirected graphs.
Characterizes the internal structure of circular components via an equivalence relation.
Provides a new Kotzig-Lovász decomposition analogue for b-factor theory.
Abstract
This paper is the first from a series of papers that establish a common analogue of the strong component and basilica decompositions for bidirected graphs. A bidirected graph is a graph in which a sign or is assigned to each end of each edge, and therefore is a common generalization of digraphs and signed graphs. Unlike digraphs, the reachabilities between vertices by directed trails and paths are not equal in general bidirected graphs. In this paper, we set up an analogue of the strong connectivity theory for bidirected graphs regarding directed trails, motivated by factor theory. We define the new concepts of {\em circular connectivity} and {\em circular components} as generalizations of the strong connectivity and strong components. In our main theorem, we characterize the inner structure of each circular component; we define a certain binary relation between vertices in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Limits and Structures in Graph Theory
