A alpha-spectral radiusMatching numberQuotient matrixBIPARTITE GRAPHSEIGENVALUESLet G be an n -vertex graph. A matching in G is a set of independent edges, i.e., no two edges in the set are adjacent in G . The matching number is the maximal size of a matching in G . Nikiforov (Appl...
摘要: We characterize the graphs which achieve the maximum value of the spectral radius of the adjacency matrix in the sets of all graphs with a given domination number and graphs with no isolated vertices and a given domination number.
$-spectral radius, especially for graphs that are not transmission regular, propose some graft transformations that decrease or increase the distance $\\alpha$-spectral radius, and determine the unique graphs with minimum and maximum distance $\\alpha$-spectral radius among some classes of graphs....
We prove upper bounds for the spectral radius ρ(G) of an n-vertex graph with given maximum degree and girth at least 2ℓ+1. This extends the previous result of [9] regarding graphs with girth at least five. When ℓ=3 or |V(G)| is relatively small compared with the maximum degr...
2) The Spectral Radius of Tricyclic Graphs 三圈图的谱半径3) The Bounds of Spectra of a Graph 一类图谱的上界4) graph eigenvalue and eigenvector 图的谱半径和特征向量5) On the Largest Spectral Radius of Nonregular Graph 非正则图的谱半径...
Li, X.W.: Group chromatic number of Halin graphs. Graphs Combin. 31(5), 1531–1538 (2015) Article MathSciNet Google Scholar Li, D., Chen, Y., Meng, J.: The $A_{\alpha }$-spectral radius of trees and unicyclic graphs with given degree sequence. Appl. Math. Comput. 363, 12462...
Summary: Let $\cal{G}_{n,β}$ be the set of simple graphs of order $n$ with given matching number $β$. In this paper, we investigate the maximal signless Laplacian spectral radius in $\cal{G}_{n,β}$ and characterize the extremal graphs with maximal signless Laplacian spectral rad...
Considering this result, we present an upper bound on the energy of . We also show that our results generalize and improve some known results for graphs and digraphs. View full text Download full text Keywords spectral radius of a digraph, energy of a digraph AMS Subject Classifications 05...
Disproof of a conjecture on the minimum spectral radius and the domination number Let Gn,& gamma; be the set of all connected graphs on n vertices with domination number & gamma;. A graph is called a minimizer graph if it attains the min... Y Hu,Z Lou,Q Huang - 《Linear Algebra &...
A Sharp Upper Bound of the Spectral Radius of Graphs Let G be a simple connected graph with n vertices and m edges. Let δ(G)=δ be the minimum degree of vertices of G. The spectral radius ρ(G) of G is the l... H Yuan,JL Shu,K Fang - 《Journal of Combinatorial Theory》 被...