An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes

• Published in: AKCE International Journal of Graphs and Combinatorics Vol. ahead-of-print; no. ahead-of-print; pp. 1 - 20
• Main Authors: Duggaraju, Radha Madhavi, Mazumdar, Lipika
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 02.01.2020; Taylor & Francis; Taylor & Francis Group
• Subjects: Complete graphs; Generalized splines; Hypercubes; Generalized splines; Hypercubes; Complete graphs
• ISSN: 0972-8600; 2543-3474; 2543-3474
• DOI: 10.1016/j.akcej.2019.06.009

An edge labeled graph is a graph G whose edges are labeled with non-zero ideals of a commutative ring R. A Generalized Spline on an edge labeled graph G is a vertex labeling of G by elements of the ring R, such that the difference between any two adjacent vertex labels belongs to the ideal corresponding to the edge joining both the vertices. The set of generalized splines forms a subring of the product ring R|V|, with respect to the operations of coordinate-wise addition and multiplication. This ring is known as the generalized spline ring RG, defined on the edge labeled graph G, for the commutative ring R. We have considered particular graphs such as complete graphs, complete bipartite graphs and hypercubes, labeling the edges with the non-zero ideals of an integral domain R and have identified the generalized spline ring RG for these graphs. Also, general algorithms have been developed to find these splines for the above mentioned graphs, for any number of vertices and Python code has been written for finding these splines.