Results 51 to 60 of about 960 (155)
Resistance Distance and Kirchhoff Index for a Class of Graphs
Mathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018 Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin +3 more
wiley +1 more source
Some Properties of the Strong Primitivity of Nonnegative Tensors
Journal of Applied Mathematics, Volume 2018, Issue 1, 2018., 2018 We show that an order m dimension 2 tensor is primitive if and only if its majorization matrix is primitive, and then we obtain the characterization of order m dimension 2 strongly primitive tensors and the bound of the strongly primitive degree. Furthermore, we study the properties of strongly primitive tensors with n ≥ 3 and propose some problems for
Lihua You +3 more
wiley +1 more source
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
Bounds on the Spectral Radius of a Nonnegative Matrix and Its Applications
Journal of Applied Mathematics, Volume 2016, Issue 1, 2016., 2016 We obtain the sharp bounds for the spectral radius of a nonnegative matrix and then obtain some known results or new results by applying these bounds to a graph or a digraph and revise and improve two known results.
Danping Huang, Lihua You, Ali R. Ashrafi
wiley +1 more source
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
Discussiones Mathematicae Graph Theory, 2014 In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω.
Su Li, Li Hong-Hai, Zhang Jing
doaj +1 more source
On the signless Laplacian spectral radius of irregular graphs
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ning, Wenjie, Li, Hao, Lu, Mei
openaire +2 more sources
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, Volume 2015, Issue 1, 2015., 2015 The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all ...
Guisheng Jiang +3 more
wiley +1 more source
Spectral Radius and Hamiltonicity of Graphs
Discussiones Mathematicae Graph Theory, 2019 In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +1 more source
On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
, 2015 In order to investigate the non-odd-bipartiteness of even uniform hypergraphs, starting from a simple graph $G$, we construct a generalized power of $G$, denoted by $G^{k,s}$, which is obtained from $G$ by blowing up each vertex into a $k$-set and each ...
Fan, Yi-Zheng, Khan, Murad-ul-Islam
core +1 more source
k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj +1 more source