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...
保存先:
第一著者: | |
---|---|
フォーマット: | 論文 |
言語: | English |
出版事項: |
2022
|
主題: | |
オンライン・アクセス: | https://ir.uitm.edu.my/id/eprint/72511/1/72511.pdf https://ir.uitm.edu.my/id/eprint/72511/ https://jmcs.com.my/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|