.png){kind=icon}
Return
The Frank graph
.png){kind=icon}
PRE
AI
DOI：10.2989/16073606.2025.2607410.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces the Frank graph, a special weighted digraph with self-loops whose adjacency matrix corresponds to the Frank matrix, a special Max matrix. We derive bounds for the spectral radius and energy of the graph and illustrate these results with numerical examples. By investigating the spectral properties and extending the analysis of energy to weighted digraphs with self-loops, this study provides new insights and serves as a reference for future research on graphs with specialized adjacency matrices.
Keywords:
Frank graph
Frank matrix
spectral radius
weighted digraph
Journal
Q
IF:
0.8
Papers:
79
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more