On the page-number of a circulant graph
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 in...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2438388 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841546478931148800 |
|---|---|
| author | Xiaoyuan Dong Dengju Ma |
| author_facet | Xiaoyuan Dong Dengju Ma |
| author_sort | Xiaoyuan Dong |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-01a692ba70f3447e9b0b62e4879ba92f |
| institution | Kabale University |
| issn | 0972-8600 2543-3474 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj-art-01a692ba70f3447e9b0b62e4879ba92f2025-01-10T17:15:36ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742025-01-011710.1080/09728600.2024.2438388On the page-number of a circulant graphXiaoyuan Dong0Dengju Ma1Department of Primary Education, Nantong Normal College, Nantong, P. R. ChinaSchool of Mathematics and Statistics, Nantong University, Nantong, P. R. ChinaThe 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.https://www.tandfonline.com/doi/10.1080/09728600.2024.2438388Book embeddingpage-numbercirculant graphs05C10 |
| spellingShingle | Xiaoyuan Dong Dengju Ma On the page-number of a circulant graph AKCE International Journal of Graphs and Combinatorics Book embedding page-number circulant graphs 05C10 |
| title | On the page-number of a circulant graph |
| title_full | On the page-number of a circulant graph |
| title_fullStr | On the page-number of a circulant graph |
| title_full_unstemmed | On the page-number of a circulant graph |
| title_short | On the page-number of a circulant graph |
| title_sort | on the page number of a circulant graph |
| topic | Book embedding page-number circulant graphs 05C10 |
| url | https://www.tandfonline.com/doi/10.1080/09728600.2024.2438388 |
| work_keys_str_mv | AT xiaoyuandong onthepagenumberofacirculantgraph AT dengjuma onthepagenumberofacirculantgraph |