Group connectivity for K^-k_m, n
Let \(G = (V,E)\) be an undirected graph and \(A\) an abelian group with identity \(0\). The graph \(G\) is \(A\)-connected if there exists an orientation of \(G\) such that for every function \(b: V \longrightarrow A\) with \(\sum_{v \in V} b(v) = 0\) there exists a function \(f: E \longrightarrow A \setminus \{0\}\) such that \(b(v) = \sum_{e {\mathrm { leaving }} v} f(e) - \sum_{e {\mathrm{ \;entering\;}} v} f(e)\) for all \(v \in V\). For every nontrivial group \(A\), a necessary condition for being \(A\)-connected is that \(G\) is \(2\)-edge-connected.NEWLINENEWLINEThis concept of \(A\)-connectivity was introduced in [\textit{F. Jaeger} et al., J. Comb. Theory, Ser. B 56, No. 2, 165--182 (1992; Zbl 0824.05043)] to study the existence of \(A\)-nonzero flows. In particular, \(A\)-connectivity implies the existence of \(A\)-nonzero flows.NEWLINENEWLINEIn the paper under review the authors study the connectivity number of a \(2\)-edge-connected graph, that is, the smallest value \(h\) such that the graph is \(A\)-connected for every abelian group \(A\) with \(| A | \geq h\). More precisely, they obtain the exact value for the connectivity number of \(G\) when \(G = K_{m,n}^{-k}\) for \(m, n \geq 3\), except for \(K_{5,4}^{-4}\). Here, \(K_{m,n}^{-k}\) denotes the graph obtained after removing \(k\) independent edges from a complete bipartite graph with partitions of size \(m\) and \(n\).
- Group connectivity of certain graphs
- Group connectivity of graphs with diameter at most 2
- Group connectivity of two kinds of graphs
- A generalization of 0-sum flows in graphs
- Group connectivity under 3‐edge‐connectivity
- Group connectivity and group colorings of graphs --- a survey
- Flow-contractible configurations and group connectivity of signed graphs
- Group connectivity and group coloring: small groups versus large groups
- scientific article; zbMATH DE number 3947966
- A dual version of the brooks group coloring theorem
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Bigraphic pairs with an A-connected realization
- The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- Disconnectedness of the subgraph \(F^3\) for the group \({\varGamma}^3\)
- Group connectivity of certain graphs
- Group connectivity of Kneser graphs
- Group connectivity of two kinds of graphs
- scientific article; zbMATH DE number 5172365 (Why is no real title available?)
- On group hypo-connected graphs
- Nonabelian flows in networks
This page was built for publication: Group connectivity for \(K^{-k}_{m, n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870951)
