The characteristic ideal of a finite, connected, regular graph

  • Authors:

  • Josep M. Brunat;Antonio Montes

  • Affiliations:

  • Universitat Politècnica de Catalunya, Barcelona, Spain;Universitat Politècnica de Catalunya, Barcelona, Spain

  • Venue:
  • ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let Φ(x,y)∈ ℂ[x,y] be a symmetric polynomial of partial degree d. The graph G(Φ) is defined by taking ℂ as set of vertices and the points of 𝕍 (Φ(x,y)) as edges. We study the following problem: given a finite, connected, d-regular graph H, find the polynomials Φ(x,y) such that G(Φ) has some connected component isomorphic to H and, in this case, if G(Φ) has (almost) all components isomorphic to H. The problem is solved by associating to H a characteristic ideal which offers a new perspective to the conjecture formulated in a previous paper, and allows to reduce its scope. In the second part, we determine the characteristic ideal for cycles of lengths ≤ 5 and for complete graphs of order ≤ 6. This results provide new evidence for the conjecture.