Factoring cardinal product graphs in polynomial time

“…Wilfried Imrich [1] gives a polynomial time algorithm for recognizing tensor product graphs and finding a factorization of any such graph. This product is commutative and associative in a natural way (refer [2] for a detailed description on product graphs).…”

Section: Direct Product Graphsmentioning

confidence: 99%

Some Properties of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

Maheswari¹,

Maheswari²

2012

IJCA

View full text Add to dashboard Cite

Nathanson was the pioneer in introducing the concepts of Number Theory, particularly, the "Theory of Congruences" in Graph Theory, thus paving way for the emergence of a new class of graphs, namely "Arithmetic Graphs". Cayley graphs are another class of graphs associated with the elements of a group. If this group is associated with some arithmetic function then the Cayley graph becomes an Arithmetic graph.In this paper, we present some results related to basic properties of direct product graphs of Euler totient Cayley graphs with Arithmetic graph.

show abstract

“…Wilfried Imrich [6] gives a polynomial time algorithm for recognizing tensor product graphs and finding a factorization of any such graph.…”

Section: Direct Product Graphsmentioning

confidence: 99%