Skip to main navigation Skip to search Skip to main content

On the degeneracy of the orbit polynomial and related graph polynomials

  • Shahid Rajaee Teacher Training University
  • Swiss Distance University of Applied Science
  • Private University for Health Sciences, Medical Informatics and Technology
  • Nankai University
  • Tampere University

Research output: Contribution to journalArticlepeer-review

Abstract

The orbit polynomial is a new graph counting polynomial which is defined as (formula presented) where O1, …, Or are all vertex orbits of the graph G. In this article, we investigate the structural properties of the automorphism group of a graph by using several novel counting polynomials. Besides, we explore the orbit polynomial of a graph operation. Indeed, we compare the degeneracy of the orbit polynomial with a new graph polynomial based on both eigenvalues of a graph and the size of orbits.

Original languageEnglish
Article number1643
Pages (from-to)1-11
Number of pages11
JournalSymmetry
Volume12
Issue number10
DOIs
Publication statusPublished - 7 Oct 2020
Externally publishedYes

Keywords

  • Automorphism group
  • Group action
  • Orbit
  • Orbit-stabilizer theorem
  • Polynomial roots

Fingerprint

Dive into the research topics of 'On the degeneracy of the orbit polynomial and related graph polynomials'. Together they form a unique fingerprint.

Cite this