English

Symmetry Parameters for Mycielskian Graphs

Combinatorics 2021-03-10 v1

Abstract

The Mycielskian construction, denoted μ(G)\mu(G), takes a finite simple graph GG to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielskian construction, denoted μt(G)\mu_t(G), takes GG to a larger graph with the same chromatic number but with larger odd girth. In this chapter we look at symmetry parameters of μ(G)\mu(G) and μt(G)\mu_t(G) in terms of the same parameters of GG. These symmetry parameters include determining number, distinguishing number, and cost of distinguishing.

Keywords

Cite

@article{arxiv.2103.05417,
  title  = {Symmetry Parameters for Mycielskian Graphs},
  author = {Debra Boutin and Sally Cockburn and Lauren Keough and Sarah Loeb and K. E. Perry and Puck Rombach},
  journal= {arXiv preprint arXiv:2103.05417},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:2007.15284

R2 v1 2026-06-23T23:55:04.809Z