Additive edge labelings

@article{Dickenstein2010AdditiveEL,
  title={Additive edge labelings},
  author={A. Dickenstein and Enrique A. Tobis},
  journal={Discret. Appl. Math.},
  year={2010},
  volume={158},
  pages={444-452}
}
  • A. Dickenstein, Enrique A. Tobis
  • Published 2010
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • Let G=(V,E) be a graph and d a positive integer. We study the following problem: for which labelings f"E:E->Z"d is there a labeling f"V:V->Z"d such that f"E(i,j)=f"V(i)+f"V(j)(modd), for every edge (i,j)@?E? We also explore the connections of the equivalent multiplicative version to toric ideals. We derive a polynomial algorithm to answer these questions and to obtain all possible solutions. 
    1 Citations

    Figures and Topics from this paper.

    Métodos algebraicos para problemas discretos

    References

    SHOWING 1-10 OF 13 REFERENCES
    A Dynamic Survey of Graph Labeling
    • 2,068
    • PDF
    Rees algebras of edge ideals
    • 132
    On felicitous graphs
    • 21
    • PDF
    On the minors of an incidence matrix and its Smith normal form
    • 46
    On Additive Bases and Harmonious Graphs
    • 280
    • PDF
    Algorithmic and complexity results for decompositions of biological networks into monotone subsystems
    • 67
    • Highly Influential
    • PDF
    Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
    • 396
    • Highly Influential
    • PDF
    Gröbner bases and convex polytopes
    • 1,512
    E-mail address: alidick@dm.uba.ar E-mail address: etobis@dc.uba.ar Departamento de Matemática
    • C1428EGA) Buenos Aires