2020
DOI: 10.3390/sym12091411
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the Graovac–Pisanski Index of Some Polyhedral Graphs Based on Their Symmetry Group

Abstract: The Graovac–Pisanski (GP) index of a graph is a modified version of the Wiener index based on the distance between each vertex x and its image α(x), where α is an automorphism of graph. The aim of this paper is to compute the automorphism group of some classes of cubic polyhedral graphs and then we determine their Wiener index. In addition, we investigate the GP-index of these classes of graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…Creating polynomials on the set of orbits of a graph would help to distinguish vertices having different properties and thus to separate them into different orbits; see [19,20].…”
Section: Methods and Resultsmentioning
confidence: 99%
“…Creating polynomials on the set of orbits of a graph would help to distinguish vertices having different properties and thus to separate them into different orbits; see [19,20].…”
Section: Methods and Resultsmentioning
confidence: 99%
“…Automorphism groups help identify and classify symmetries in crystal lattices, aiding in the analysis and prediction of crystallographic patterns and properties. For example, reference (35,36) gives examples of the use of the apparatus of group theory in research on crystallography, quantum mechanics, and elementary particle physics. In particular, in these studies matrix groups and representations of unitary groups are actively used.…”
Section: Applications Of Automorphism Group In Real Lifementioning
confidence: 99%