Results 41 to 50 of about 140 (117)
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
Signless Laplacian spectral radius and Hamiltonicity
Linear Algebra and its Applications, 2010 For an \(n\) vertex of a graph \(G\), the matrix \(L^*(G)=D(G)+A(G)\) is the signless Laplacian matrix of \(G\), where \(D(G)\) is the diagonal matrix of vertex degrees and \(A(G)\) is the adjacency matrix of \(G\). Let \(\gamma(G)\) be the largest eigenvalue of \(L^*(G)\).
openaire +1 more source
Signless Laplacian spectral radius and matching in graphs
, 2020 The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix. The largest eigenvalue of $Q(G)$ is called the signless Laplacian spectral radius, denoted by $q_1=q_1(G)$.
Liu, Chang, Pan, Yingui, Li, Jianping
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
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
Graphs with maximal signless Laplacian spectral radius
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Ting-Jung, Tam, Bit-Shun
openaire +2 more sources
On the Aα-Spectral Radii of Cactus Graphs
Mathematics, 2020 Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
On Generalized Harary Eigenvalues and Generalized Join of Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this work, we further study the generalized Harary matrix of a connected graph G, which we denote by RDα(G). This matrix is defined as the convex combination RDα(G) = αRT(G) + (1 − α)RD(G), where 0 ≤ α ≤ 1. In this formulation, RD(G) refers to the classical Harary matrix, and RT(G) represents a diagonal matrix of reciprocal transmission degrees of G.
Abdollah Alhevaz +4 more
wiley +1 more source
The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth [PDF]
The Electronic Journal of Combinatorics, 2011 Let $\mathcal{U}(n,g)$ and $\mathcal{B}(n,g)$ be the set of unicyclic graphs and bicyclic graphs on $n$ vertices with girth $g$, respectively. Let $\mathcal{B}_{1}(n,g)$ be the subclass of $\mathcal{B}(n,g)$ consisting of all bicyclic graphs with two edge-disjoint cycles and $\mathcal{B}_{2}(n,g)=\mathcal{B}(n,g)\backslash\mathcal{B}_{1}(n,g)$.
Ke Li, Ligong Wang 0001, Guopeng Zhao
openaire +3 more sources
Sufficient Conditions for Spanning k‐Hypertrees via Distance Spectral Radius of Hypergraphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.For an integer k ≥ 2, a spanning k‐hypertree T is defined as a spanning hypertree (β‐acyclic) such that the maximum degree dT(v) of every vertex v ∈ V(T) is at most k. A sufficient condition for the existence of a spanning k‐hypertree in connected hypergraphs is established.
Qiannan Niu +4 more
wiley +1 more source