Not checkedNot checked for notices yet.
On the page-number of a circulant graph
Xiaoyuan Dong, Dengju Ma
AKCE International Journal of Graphs and Combinatorics · 2025
doi:10.1080/09728600.2024.2438388 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive integers satisfying [Formula: see text] and indices is read modulo m. In the paper we show that the page-number of a circulant graph C(m, n) is three except for [Formula: see text], where the page-number of [Formula: see text] is two.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.