Weighted modulo orientations of graphs and signed graphs
Summary: Given a graph \(G\) and an odd prime \(p\), for a mapping \(f: E(G) \to \mathbb{Z}_p\setminus\{0\}\) and a \(\mathbb{Z}_p\)-boundary \(b\) of \(G\), an orientation \(\tau\) is called an \((f, b; p)\)-orientation if the net out \(f\)-flow is the same as \(b(v)\) in \(\mathbb{Z}_p\) at each vertex \(v\in V(G)\) under orientation \(D\). This concept was introduced by \textit{L. Esperet} et al. [SIAM J. Discrete Math. 32, No. 1, 534--542 (2018; Zbl 1380.05092)], generalizing mod \(p\)-orientations and closely related to Tutte's nowhere zero 3-flow conjecture. They proved that \((6p^2 - 14p + 8)\)-edge-connected graphs have all possible \((f, b; p)\)-orientations. In this paper, the framework of such orientations is extended to signed graph through additive bases. We also study the \((f, b; p)\)-orientation problem for some (signed) graphs families including complete graphs, chordal graphs, series-parallel graphs and bipartite graphs, indicating that much lower edge-connectivity bound still guarantees the existence of such orientations for those graph families.
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Additive bases and flows in graphs
- Additive bases of vector spaces over prime fields
- Counterexamples to Jaeger's circular flow conjecture
- Flow-contractible configurations and group connectivity of signed graphs
- Graph theory
- Group connectivity and group colorings of graphs --- a survey
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity of certain graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- scientific article; zbMATH DE number 193142 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Integer flows and orientations
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- On weighted modulo orientation of graphs
- Treewidth. Computations and approximations
This page was built for publication: Weighted modulo orientations of graphs and signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2112587)