The connectivity and wiener index of order graph in symmetric group / S. M. Kasim
Let G be a finite group and x is an element of G. Then, the order graph of a finite group denoted by OG, is a digraph and for any two distinct vertices x and y, there is an edge from x to y if and only if x divide y. The Wiener index is defined as the summation of distances between all pairs of vert...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Published: |
2022-12.
|
| Subjects: | |
| Online Access: | Link Metadata |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Link Metadata3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |