Results 11 to 20 of about 2,028,246 (339)

Spectral Radius and Hamiltonicity of Graphs [PDF]

open access: yesDiscussiones 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   +3 more sources

A generalization of spectral radius, numerical radius, and spectral norm

open access: bronzeLinear Algebra and its Applications, 1987
AbstractLet Cn be the linear space of complex column vectors with n coordinates associated with the usual inner product. Denote by Λk the set of all k-tuples of orthonormal vectors in Cn. Given a real number p⩾ 1and an n × n complex matrix A with eigenvalues λ1,…,λn, we define ρp − k = max∑j = 1k∣λij ∣p1p :1 ...
Chi-Kwong Li
openalex   +3 more sources

Spectral radius and edge‐disjoint spanning trees [PDF]

open access: yesJournal of Graph Theory, 2022
The spanning tree packing number of a graph G $G$ , denoted by τ( G ) $\tau (G)$ , is the maximum number of edge‐disjoint spanning trees contained in G $G$ . The study of τ( G ) $\tau (G)$ is one of the classic problems in graph theory.
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
semanticscholar   +1 more source

Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra [PDF]

open access: yesSahand Communications in Mathematical Analysis, 2020
In this paper, we discuss some properties of joint spectral {radius(jsr)} and  generalized spectral radius(gsr)  for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized
Hamideh Mohammadzadehkan   +2 more
doaj   +1 more source

On the joint spectral radius [PDF]

open access: hybridAnnales Polonici Mathematici, 1997
We prove the `p-spectral radius formula for n-tuples of commuting Banach algebra elements. This generalizes results of some earlier papers. Let A be a Banach algebra with the unit element denoted by 1. Let a = (a1, . . . , an) be an n-tuple of elements of A. Denote by σ(a) the Harte spectrum of a, i.e. λ = (λ1, . . .
Veronika Müller
openalex   +3 more sources

The spanning k-trees, perfect matchings and spectral radius of graphs [PDF]

open access: yesLinear and multilinear algebra, 2021
A k-tree is a spanning tree in which every vertex has degree at most k. In this paper, we provide a sufficient condition for the existence of a k-tree in a connected graph with fixed order in terms of the adjacency spectral radius and the signless ...
Dandan Fan   +3 more
semanticscholar   +1 more source

Relating Estrada index with spectral radius [PDF]

open access: yesJournal of the Serbian Chemical Society, 2007
The Estrada index EE is a recently proposed molecular structure-descriptor, used in the modeling of certain features of the 3D structure of organic molecules, in particular of the degree of folding of proteins and other long-chain biopolymers.
Gutman Ivan   +4 more
doaj   +3 more sources

On the Aα-spectral radius of connected graphs

open access: yesArs Math. Contemp., 2022
For a simple graph G , the generalized adjacency matrix A α ( G ) is defined as A α ( G ) = αD ( G ) + (1 − α ) A ( G ) , α ∈ [0 , 1] , where A ( G ) is the adjacency matrix and D ( G ) is the diagonal matrix of the vertex degrees. It is clear that A 0 (
A. Alhevaz   +3 more
semanticscholar   +1 more source

Unbalanced signed graphs with extremal spectral radius or index

open access: yesComputational and Applied Mathematics, 2022
Let G˙=(G,σ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\dot{G}=(G ...
M. Brunetti, Z. Stanić
semanticscholar   +1 more source

Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length [PDF]

open access: yesElectronic Journal of Combinatorics, 2021
 In this paper, we provide spectral conditions for the existence of two edge-disjoint cycles and two cycles of the same length in a graph, which can be viewed as the spectral analogues of Erdős and Posa's condition and Erdős' classic problem about the ...
Huiqiu Lin, M. Zhai, Yanhua Zhao
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy