惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Microsoft Security Blog
Microsoft Security Blog
Jina AI
Jina AI
量子位
博客园 - 叶小钗
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
IT之家
IT之家
S
SegmentFault 最新的问题
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
雷峰网
雷峰网
博客园 - 聂微东
美团技术团队
Last Week in AI
Last Week in AI
罗磊的独立博客
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园_首页
V
Visual Studio Blog
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
The general spectral radius and majorization theorem of $...
Yufei Huang, Muhuo Liu · 2019-08-17 · via math.CO updates on arXiv.org

The general spectral radius of a graph $G$, denoted by $Θ(G,α)$, is the maximal eigenvalue of $M_α(G)=A(G)+αD(G)$ $(α\geq 0)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the diagonal matrix of vertex degrees of $G$, respectively. A graph $G$ is called $Θ_α$-maximal in a class of connected simple graphs $\mathcal {G}$ if $Θ(G,α)$ is maximal among all graphs of $\mathcal {G}$. A $t$-cone $c$-cyclic graph is the join of a complete graph $K_t$ and a $c$-cyclic connected simple graph. Let $π=\big(d_1,d_2,\ldots,d_n\big)$ and $π'=\big(d'_1,d'_2,\ldots,d'_n\big)$ be two non-increasing degree sequences of $t$-cone $c$-cyclic graphs with $n$ vertices. We say $π$ is strictly majorized by $π'$, denoted by $π\lhd π'$, if $π\neq π'$, $\sum_{i=1}^n d_i=\sum_{i=1}^n d_i'$, and $\sum_{i=1}^k d_i\leq \sum_{i=1}^k d_i'$ for $k=1,2,\ldots,n-1$. Denote by $Γ(π,t;c)$ the class of $t$-cone $c$-cyclic graphs with $π$ as its degree sequence. In this paper, we determine some properties of $Θ_α$-maximal graphs of $Γ(π,t;c)$ and characterize the unique $Θ_α$-maximal graph of $Γ(π,t;0)$ \big(resp. $Γ(π,t;1)$ and $Γ(π,t;2)$\big). Moreover, we prove that if $π\lhd π'$, $G$ and $G'$ are the $Θ_α$-maximal graphs of $Γ(π,t;c)$ and $Γ(π',t;c)$ respectively, then $Θ(G,α)<Θ(G',α)$ for $c\in \big\{0,1\big\}$, and we also consider the similar result for $c=2$.