Special Generation of Random Graphs and Statistical Study of Some of Their Invariants
In this paper, we generate random graphs for a specific area, namely, models of real communication networks. We propose a method that determines the “best” invariant; the corresponding basic algorithm is as follows. For the generated set of graphs, we calculate the numerical values of each of the pr...
Saved in:
| Main Authors: | Boris Melnikov, Bowen Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/12/1904 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
THE INTERSECTION GRAPH REPRESENTATION OF A DIHEDRAL GROUP WITH PRIME ORDER AND ITS NUMERICAL INVARIANTS
by: Dewi Santri Ramdani, et al.
Published: (2022-09-01) -
On the rank of the Doob graph and its complement
by: Ilhan Hacioglu, et al.
Published: (2018-08-01) -
On Strongly Regular Graphs and the Friendship Theorem
by: Igal Sason
Published: (2025-03-01) -
Graph Entropy of Some Special Chemical Graphs
by: B. I. Andrew, et al.
Published: (2024-12-01) -
InvarNet: Molecular property prediction via rotation invariant graph neural networks
by: Danyan Chen, et al.
Published: (2024-12-01)