On the odd girth and the circular chromatic number of generalized Petersen graphs

Amir Daneshgar () and Meysam Madani
Additional contact information
Amir Daneshgar: Sharif University of Technology
Meysam Madani: Sharif University of Technology

Journal of Combinatorial Optimization, 2017, vol. 33, issue 3, No 6, 897-923

Abstract: Abstract A class $$\mathcal{G}$$ G of simple graphs is said to be girth-closed (odd-girth-closed) if for any positive integer g there exists a graph $$\mathrm {G} \in \mathcal{G}$$ G ∈ G such that the girth (odd-girth) of $$\mathrm {G}$$ G is $$\ge g$$ ≥ g . A girth-closed (odd-girth-closed) class $$\mathcal{G}$$ G of graphs is said to be pentagonal (odd-pentagonal) if there exists a positive integer $$g^*$$ g ∗ depending on $$\mathcal{G}$$ G such that any graph $$\mathrm {G} \in \mathcal{G}$$ G ∈ G whose girth (odd-girth) is greater than $$g^*$$ g ∗ admits a homomorphism to the five cycle (i.e. is $$\mathrm {C}_{_{5}}$$ C 5 -colourable). Although, the question “Is the class of simple 3-regular graphs pentagonal?” proposed by Nešetřil (Taiwan J Math 3:381–423, 1999) is still a central open problem, Gebleh (Theorems and computations in circular colourings of graphs, 2007) has shown that there exists an odd-girth-closed subclass of simple 3-regular graphs which is not odd-pentagonal. In this article, motivated by the conjecture that the class of generalized Petersen graphs is odd-pentagonal, we show that finding the odd girth of generalized Petersen graphs can be transformed to an integer programming problem, and using the combinatorial and number theoretic properties of this problem, we explicitly compute the odd girth of such graphs, showing that the class is odd-girth-closed. Also, we obtain upper and lower bounds for the circular chromatic number of these graphs, and as a consequence, we show that the subclass containing generalized Petersen graphs $$\mathrm {Pet}(n,k)$$ Pet ( n , k ) for which either k is even, n is odd and $$n\mathop {\equiv }\limits ^{k-1}\pm 2$$ n ≡ k - 1 ± 2 or both n and k are odd and $$n\ge 5k$$ n ≥ 5 k is odd-pentagonal. This in particular shows the existence of nontrivial odd-pentagonal subclasses of 3-regular simple graphs.

Keywords: Generalized Petersen graphs; Integer programming; Odd girth; Circular colouring; Pentagon problem (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0013-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:3:d:10.1007_s10878-016-0013-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0013-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().