Rings of Graph

Martin Eduardo Frias Armenta; N. Campanelli; J.L. Martínez-Morales

doi:10.1016/j.endm.2014.08.008

Rings of Graph

Martin Eduardo Frias Armenta, N. Campanelli, J.L. Martínez-Morales

Departamento de Matemáticas

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We construct all possible rings taking graphs as elements, the union or sum of graphs as the binary operation of the group and graph product as the second operation. Furthermore we show that every ring formed with union operation is isomorphic to some ring with sum operation. In every case, we give an homomorphism from the ring to the integers polynomial. (This is an extended abstract of Campanelli, Nicolas, Martín Eduardo Frías Armenta and Jose L. Martinez-Morales, Ring of graphs, Submited to boletin de la sociedad mexicana de matemáticas.).

Original language	English
Pages (from-to)	51-56
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	46
Issue number	1
DOIs	https://doi.org/10.1016/j.endm.2014.08.008
State	Published - 1 Sep 2014

Bibliographical note

Publisher Copyright:
© 2014 Elsevier B.V.

Keywords

Clique polynomial
Graph products
Ring
Union and sum of graphs

Access to Document

10.1016/j.endm.2014.08.008

Cite this

@article{5360fd8d13db4789b7187484d168ddcd,

title = "Rings of Graph",

abstract = "We construct all possible rings taking graphs as elements, the union or sum of graphs as the binary operation of the group and graph product as the second operation. Furthermore we show that every ring formed with union operation is isomorphic to some ring with sum operation. In every case, we give an homomorphism from the ring to the integers polynomial. (This is an extended abstract of Campanelli, Nicolas, Mart{\'i}n Eduardo Fr{\'i}as Armenta and Jose L. Martinez-Morales, Ring of graphs, Submited to boletin de la sociedad mexicana de matem{\'a}ticas.).",

keywords = "Clique polynomial, Graph products, Ring, Union and sum of graphs",

author = "{Frias Armenta}, {Martin Eduardo} and N. Campanelli and J.L. Mart{\'i}nez-Morales",

note = "Publisher Copyright: {\textcopyright} 2014 Elsevier B.V.",

year = "2014",

month = sep,

day = "1",

doi = "10.1016/j.endm.2014.08.008",

language = "Ingl{\'e}s",

volume = "46",

pages = "51--56",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Rings of Graph

AU - Frias Armenta, Martin Eduardo

AU - Campanelli, N.

AU - Martínez-Morales, J.L.

PY - 2014/9/1

Y1 - 2014/9/1

N2 - We construct all possible rings taking graphs as elements, the union or sum of graphs as the binary operation of the group and graph product as the second operation. Furthermore we show that every ring formed with union operation is isomorphic to some ring with sum operation. In every case, we give an homomorphism from the ring to the integers polynomial. (This is an extended abstract of Campanelli, Nicolas, Martín Eduardo Frías Armenta and Jose L. Martinez-Morales, Ring of graphs, Submited to boletin de la sociedad mexicana de matemáticas.).

AB - We construct all possible rings taking graphs as elements, the union or sum of graphs as the binary operation of the group and graph product as the second operation. Furthermore we show that every ring formed with union operation is isomorphic to some ring with sum operation. In every case, we give an homomorphism from the ring to the integers polynomial. (This is an extended abstract of Campanelli, Nicolas, Martín Eduardo Frías Armenta and Jose L. Martinez-Morales, Ring of graphs, Submited to boletin de la sociedad mexicana de matemáticas.).

KW - Clique polynomial

KW - Graph products

KW - Ring

KW - Union and sum of graphs

UR - http://www.scopus.com/inward/record.url?scp=84923949102&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2014.08.008

DO - 10.1016/j.endm.2014.08.008

M3 - Artículo

SN - 1571-0653

VL - 46

SP - 51

EP - 56

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

IS - 1

ER -

Rings of Graph

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this