The Clique Fractal of Circulant Graphs
Keywords:
Circulant Graph, Fractal, Lexicographic Product, Clique Number, Clique PolynomialAbstract
In this paper, we explore the clique polynomial of Circulant graphs. The lexicographic product of a Circulant graph of order n with S as the generating set is being computed (k times) and the closure of the union of the roots of reduced clique polynomial of powers is plotted and the graph approaches a fractal like object, the Julia set. We also try to explore the fractals of the clique polynomial of trees.
References
1. Barnsley M, Fractals Everywhere. San Diego: Academic Press. 1988. 2. Brown JI, Hickman CA, Nowakowski RJ. The independence fractal of a graph. Journal of Combinatorial Theory 2003; 87(2): 209-230. 3. Weisstein EW. Julia Set. Math World 1999 2005 [cited 2005 11/20/05]; Available from: http://mathworld. wolfram.com/JuliaSet.html. 4. Boesch F, Tindell R. Circulants and their Connectivities. Journal of Graph Theory 1984; 8(4): 487-499. 5. Brown JI, Nowakowski RJ. Bounding the roots of independence polynomials, Ars Combin 2001; 58: 113–1206. Brown JI, Dilcher K, Nowakowski RJ. Roots of Independence Polynomials of Well-Covered Graphs, Journal of Algebraic Combinatorics 2000; 11(3): 197210. 7. Brown JI, Hickman CA, Nowakowski RJ. On the Location of Roots of Independence Polynomials. Journal of Algebraic Combinatorics 2004; 19: 273-282. 8. Brown JI, Nowakowski RJ, Bounding the Roots of Independence Polynomials, Ars Combinatoria 2001; 58: 113-120. 9. Levit VE, Mandrescu E, The Independence Polynomial of a Graph { A Survey, submitted (preprint). 10. Adam A, Research Problem 2-10, Journal of Combinatorial Theory 1967; 2: 309. 11. Alspach B, Parsons T, Isomorphism of Circulant Graphs and Digraphs, Discrete Mathematics 1979; 25: 97-108. 12. Wu J, Song Z, A Class of Star Extremal Circulant Graphs. Journal of Southeast University (English Edition) 2002; 18: 177-179.
Published
2017-12-20
