학술
기타
All limit points of the largest roots of matching polynomials are determined
arXiv Math
조회 0
이 뉴스, 어떠셨어요?
한 번의 탭으로 반응을 남겨요 · 로그인 불필요
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
The largest matching root $\mu(G)$ of a graph $G$ is that of its matching polynomial.
In this paper, all limit points of the largest matching roots of graphs are determined.
More precisely, we identify the limit points of the largest matching roots of graphs less than $\tau^{\frac{1}{2}}+\tau^{-\frac{1}{2}}$.
For any $\gamma \geq \tau^{\frac{1}{2}}+\tau^{-\frac{1}{2}}$ with $\tau=\frac{\sqrt{5}+1}{2}$, there exists a graph sequence $\{G_i\, |\, i\in \mathbb{N}\}$ such that $\lim\limits_{i \rightarrow \infty}\mu(G_i)=\gamma$.
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
arXiv의 다른 기사
MER-R1: Multimodal Emotion Reasoning via Slow-Fast Thinking Synergy
arXiv CS.AI
ToE: A Hierarchical and Explainable Claim Verification Framework with Dynamic Multi-source Evidence Retrieval and Aggregation
arXiv CS.AI
Towards Reliable and Robust LLM Planning: Symbolic Feedback-Driven Iterative Self-Refinement Framework
arXiv CS.AI