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...

Full description

Saved in:
Bibliographic Details
Main Author: Kasim, S. M.
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/72511/1/72511.pdf
https://ir.uitm.edu.my/id/eprint/72511/
https://jmcs.com.my/
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first