Minimum Distance Spectral Radius of Graphs with Given Edge Connectivity

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…