Totally frustrated states in the chromatic theory of gain graphs

DOI10.1016/J.EJC.2008.02.004zbMATH Open1165.05011arXivmath/0609048OpenAlexW1980290964MaRDI QIDQ2519802FDOQ2519802

Authors: Thomas Zaslavsky 

Publication date: 27 January 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of `qualities' or `spins' that is permuted by the gain group. (An example is the Potts model.) The number of totally frustrated states satisfies the usual deletion-contraction law but is matroidal only for standard coloring, where the group action is trivial or nearly regular. One can generalize chromatic polynomials by constructing spin sets with repeated transitive components.

Full work available at URL: https://arxiv.org/abs/math/0609048

Recommendations

• An elementary chromatic reduction for gain graphs and special hyperplane arrangements
• Chromatic and flow polynomials for directed graphs
• Biased graphs. III: Chromatic and dichromatic invariants
• Exact chromatic polynomials for toroidal chains of complete graphs
• Weighted graph colorings

zbMATH Keywords

dichromatic polynomialchromatic polynomialstategain graphgain groupstate chromatic functiontotally frustrated stateWhitney number polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• On geometric semilattices
• A mathematical bibliography of signed and gain graphs and allied areas
• Biased graphs. III: Chromatic and dichromatic invariants
• The Tutte polynomial
• On the notion of balance of a signed graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Biased graphs. I: Bias, balance, and gains
• Biased graphs. II: The three matroids
• The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
• Generating all graph coverings by permutation voltage assignments
• Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
• Title not available (Why is that?)
• The theory of quality translations with applications to tilings
• On the Möbius algebra of a partially ordered set

Cited In (7)

• Title not available (Why is that?)
• An elementary chromatic reduction for gain graphs and special hyperplane arrangements
• Burnside chromatic polynomials of group-invariant graphs
• Concepts of signed graph coloring
• Coloring permutation-gain graphs
• Spectra of quaternion unit gain graphs
• Quadratic-monomial generated domains from mixed signed, directed graphs

This page was built for publication: Totally frustrated states in the chromatic theory of gain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519802)