On the largest two and smallest six distance Pareto eigenvalues of a graph
Abstract
In this article, we establish some bounds involving the largest two distance Pareto eigenvalues of a connected graph. Also we characterize all possible values for smallest six distance Pareto eigenvalues of a connected graph.
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.