Abstract
We formulate a group of graphs with graph union as operation. Out of the 256 possible graph products, only six can be used as means to define ring structures over such graph group. Likewise, using the graph join instead of the graph union, another set of graph products is available for defining ring structures. Unsurprisingly, both constructions lead to the same rings via an isomorphism.
Similar content being viewed by others
References
Campanelli, N., Frías Armenta, M.E., Martinez Morales, J.L.: Rings of Graphs. Electron. Notes Discret. Math. 46, 51–56 (2014)
Hausdorff, F.: Grundzüge der Mengenlehre. Veit and Company Leipzig (1914)
Frías Armenta, M.E., Martinez Morales, J.L.: The Grothendieck group of isomorphism classes of graphs. (In preparation)
Gringmann, L.: Hypergraph product. Diplome tesis, Leipzig (2010)
Imrich, W., Izbicki, H.: Associative products of graphs. Mon. heft. Math. 80(4), 277–281 (1975)
Imrich, W., Klavzar, S.: Product Graphs: Structure and Recognition. Wiley, New York (2000). ISBN: 978-0-471-37039-0
Whitehead, A.N., Russell, B.: Principia Mathematica, vol. 2. Cambridge University Press, Cambridge (1912)
Rosenfeld, V.R., Klein, D.J.: Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts. J. Math. Chem. 51(1), 21–37 (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is partially supported by Conacyt CB-2010/150532.
Rights and permissions
About this article
Cite this article
Campanelli, N., Frías-Armenta, M.E. & Martinez-Morales, J.L. Graph products and characterization by rings. Bol. Soc. Mat. Mex. 23, 527–535 (2017). https://doi.org/10.1007/s40590-015-0081-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40590-015-0081-7