Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The least distance eigenvalue of the complements of graphs of diameter greater than three (2302.13761v1)

Published 24 Feb 2023 in math.CO

Abstract: Suppose $G$ is a connected simple graph with the vertex set $V( G ) = { v_1,v_2,\cdots ,v_n } $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) {n\times n}$, where $d{ij}=d_G( v_i,v_j ) $. Since $D( G )$ is a non-negative real symmetric matrix, its eigenvalues can be arranged as $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$, where eigenvalue $\lambda_n(G)$ is called the least distance eigenvalue of $G$. In this paper we determine the unique graph whose least distance eigenvalue attains maximum among all complements of graphs of diameter greater than three.

Summary

We haven't generated a summary for this paper yet.