Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
From MaRDI portal
Publication:5419952
Abstract: We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian group. We study the structure of this group and the structure of two closely related to it groups: the subgroup of balanced labelings which consists of functions vanishing on vertices and the corresponding factor-group. This work is completely self-contained, except the algorithm for obtaining the 3-edge-connected components of an undirected graph, for which we make appropriate references to the literature.
Recommendations
- Groups of balanced labelings on graphs
- Balanced group-labeled graphs
- On cordial and balanced labelings of graphs
- On the balanceability of some graph classes
- On \(k\)-equitable and \(k\)-balanced labelings of graphs
- On balancedness of some graph constructions
- scientific article; zbMATH DE number 2060847
- scientific article; zbMATH DE number 125598
- scientific article; zbMATH DE number 54793
- On balanced graphs
Cited in
(7)- A class of digraph groups defined by balanced presentations
- Enumeration of balanced finite group valued functions on directed graphs
- Balanced vertex weightings and arborescences
- Groups of balanced labelings on graphs
- Balanced group-labeled graphs
- The balanced labeling of the unconnected graph \(C_8(r_1,0,r_2,0,\dots, 0)\cup G\)
- Balanced abelian group-valued functions on directed graphs
This page was built for publication: Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419952)
