Skip to content

Algebraic Graph Theory

← Back to Domain-Specific Abstractions by Domain

3 domain-specific abstractions whose origin domain is Algebraic Graph Theory.

  • Chromatic polynomial — A graph polynomial P(G,k) whose value at each nonnegative integer k counts the proper vertex colorings of graph G using k labeled colors.
  • Chromatic symmetric function — A symmetric-function graph invariant formed as the weight-generating function of all proper vertex colorings by positive integers.
  • Strongly regular graph — A regular graph with fixed numbers of common neighbors for every adjacent pair and for every nonadjacent pair, summarized by parameters (v,k,lambda,mu).