Click here to flash read.
arXiv:2403.15745v1 Announce Type: new
Abstract: This paper characterizes the graphical properties of an optimal topology with minimal Laplacian energy under the constraint of fixed numbers of vertices and edges, and devises an algorithm to construct such connected optimal graphs. These constructed graphs possess maximum vertex and edge connectivity, and more importantly, exhibit large algebraic connectivity of an optimal order provided they are not sparse. These properties guarantee fast and resilient consensus processes over these graphs.
Click here to read this post out
ID: 801808; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: March 26, 2024, 7:34 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 12
CC:
No creative common's license
No creative common's license
Comments: