Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Study of Roots of a Certain Class of Counting Polynomials

Version 1 : Received: 10 May 2023 / Approved: 10 May 2023 / Online: 10 May 2023 (10:25:39 CEST)

A peer-reviewed article of this Preprint also exists.

Ghorbani, M.; Alidehi-Ravandi, R.; Dehmer, M.; Emmert-Streib, F. A Study of Roots of a Certain Class of Counting Polynomials. Mathematics 2023, 11, 2876. Ghorbani, M.; Alidehi-Ravandi, R.; Dehmer, M.; Emmert-Streib, F. A Study of Roots of a Certain Class of Counting Polynomials. Mathematics 2023, 11, 2876.

Abstract

Suppose G is a graph with vertex-orbits O1,1 O2, . . . ,Ot, and jOi j denotes the cardinallity of Oi. Then OG (x) = åt 2 i=1 xjOi j is called as orbit polynomial. It is well-known that this polynomial 3 has a unique positive zero d in the interval [0, 1]. The aim of this paper is to study the specific 4 properties of this polynomial and then we determine the location of this root for several classes of 5 complex networks to compare with other graphical measures. Besides, we compare the unique 6 positive zero measure with several well-known centrality graph measures.

Keywords

orbit polynomial; complex networks; automorphism group; entropy

Subject

Computer Science and Mathematics, Discrete Mathematics and Combinatorics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.