Arithmetical Structures on Wheel Graphs
Combinatorics
2024-12-12 v1
Abstract
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.
Cite
@article{arxiv.2412.07816,
title = {Arithmetical Structures on Wheel Graphs},
author = {Bibhas Adhikari and Namita Behera and Dilli Ram Chhetri and Raj Bhawan Yadav},
journal= {arXiv preprint arXiv:2412.07816},
year = {2024}
}
Comments
13pages, 3figures