Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 67 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 128 tok/s Pro
Kimi K2 204 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

On the $A_α$ spectral radius and $A_α$ energy of non-strongly connected digraphs (2109.00409v1)

Published 1 Sep 2021 in math.CO

Abstract: Let $A_\alpha(G)$ be the $A_\alpha$-matrix of a digraph $G$ and $\lambda_{\alpha 1}, \lambda_{\alpha 2}, \ldots, \lambda_{\alpha n}$ be the eigenvalues of $A_\alpha(G)$. Let $\rho_\alpha(G)$ be the $A_\alpha$ spectral radius of $G$ and $E_\alpha(G)=\sum_{i=1}n \lambda_{\alpha i}2$ be the $A_\alpha$ energy of $G$ by using second spectral moment. Let $\mathcal{G}nm$ be the set of non-strongly connected digraphs with order $n$, which contain a unique strong component with order $m$ and some directed trees which are hung on each vertex of the strong component. In this paper, we characterize the digraph which has the maximal $A\alpha$ spectral radius and the maximal (minimal) $A_\alpha$ energy in $\mathcal{G}_nm$.

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.