Enumeration of balanced finite group valued functions on directed graphs
From MaRDI portal
Abstract: A group valued function on a graph is called balanced if the product of its values along any cycle is equal to the identity element of the group. We compute the number of balanced functions from edges and vertices of a directed graph to a finite group.
Recommendations
Cites work
- scientific article; zbMATH DE number 4014777 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A characterization of consistent marked graphs
- Balanced abelian group-valued functions on directed graphs
- Balanced group-labeled graphs
- Bounds on the coefficients of tension and flow polynomials
- Characterizations of consistent marked graphs
- Cycle-vanishing edge valuations of a graph
- Enumerating colorings, tensions and flows in cell complexes
- Graph theory
- Groups of balanced labelings on graphs
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
- Some further properties of consistent marked graphs
- Tension polynomials of graphs
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Tutte polynomial expansions for 2-separable graphs
- Weighted Coxeter graphs and generalized geometric representations of Coxeter groups
Cited in
(4)
This page was built for publication: Enumeration of balanced finite group valued functions on directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269737)