2024/12/10 by Bibhas Adhikari, Namita Behera, Adhikari, Bibhas +5
Computer Science · #Computability, Logic, AI Algorithms #Cellular Automata and Applications #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.2412.07816
An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article, we investigate arithmetical structures on the wheel graphs.