Network Analyzing by the Aid of Orbit Polynomial
This article aims to be a further contribution to the research on structural complexity networks. Here, we emphasize measures to determine symmetry. The so-called “orbit polynomial” is defined by <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline...
Main Authors: | Modjtaba Ghorbani, Matthias Dehmer |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-05-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/5/801 |
Similar Items
-
Orbit Polynomial of Graphs versus Polynomial with Integer Coefficients
by: Modjtaba Ghorbani, et al.
Published: (2021-04-01) -
On the Degeneracy of the Orbit Polynomial and Related Graph Polynomials
by: Modjtaba Ghorbani, et al.
Published: (2020-10-01) -
On the Roots of the Modified Orbit Polynomial of a Graph
by: Modjtaba Ghorbani, et al.
Published: (2021-05-01) -
A Study of Roots of a Certain Class of Counting Polynomials
by: Modjtaba Ghorbani, et al.
Published: (2023-06-01) -
A Note on Graphs with Prescribed Orbit Structure
by: Abbe Mowshowitz, et al.
Published: (2019-11-01)