Minimum Distance Spectral Radius of Graphs with Given Edge Connectivity
Xiao-Xin Li, Yi-Zheng Fan, Yi Wang
TL;DR
This paper identifies the unique connected graph with a specified number of vertices and edge connectivity that minimizes the distance spectral radius, advancing understanding of spectral graph properties.
Contribution
It introduces a method to determine the graph with the minimum distance spectral radius for fixed order and edge connectivity, providing a unique characterization.
Findings
Identifies the unique graph with minimum distance spectral radius for given parameters.
Establishes a relationship between edge connectivity and spectral radius.
Provides a theoretical framework for spectral optimization in graphs.
Abstract
In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Advanced Graph Theory Research