Distance spectrum, 1-factor and vertex-disjoint cycles
type: Item
instance of: scholarly article
title: Distance spectrum, 1-factor and vertex-disjoint cycles
zbMATH Open document ID: 1498.05178
author: Yuke Zhang
author: Huiqiu Lin
author: Qinghai Liu
author: Jinfeng Zheng
published in: Linear Algebra and its Applications
publication date: 2022-10-07T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7597853
zbMATH Keywords: distance spectral radius
zbMATH Keywords: 1-factor
zbMATH Keywords: vertex-disjoint cycles
MaRDI profile type: Publication
full work available at URL: j.laa.2022.08.034
OpenAlex ID: W4295122210
Wikidata QID: Q114151196
cites work: Distance spectra of graphs: a survey
cites work: Spectra of graphs
cites work: Eigenvalues and perfect matchings
cites work: Q5331116
cites work: Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
cites work: On some graphs with a unique perfect matching
cites work: Q5481401
cites work: Matchings in regular graphs from eigenvalues
cites work: On the maximal number of independent circuits in a graph
cites work: Q5722820
cites work: Q5342984
cites work: On Independent Circuits Contained in a Graph
cites work: Spectral radius and Hamiltonian properties of graphs
cites work: Spectral radius and Hamiltonian properties of graphs, II
cites work: On the Addressing Problem for Loop Switching
cites work: Inverses of trees
cites work: Q3137758
cites work: Q2716030
cites work: A tight lower bound on the matching number of graphs via Laplacian eigenvalues
cites work: Q3267903
cites work: Extremal problems on the Hamiltonicity of claw-free graphs
cites work: Q4998162
cites work: Extremal problems on distance spectra of graphs
cites work: Spectral results on Hamiltonian problem
cites work: Sufficient spectral conditions on Hamiltonian and traceable graphs
cites work: Graph invertibility
cites work: The distance spectrum of a tree
cites work: On Hamiltonian bipartite graphs
cites work: Spectral radius and matchings in graphs
cites work: The complexity of computing the permanent
cites work: On independent cycles in a bipartite graph
cites work: On graphs with a unique perfect matching
cites work: Inverses of bipartite graphs
cites work: Perfect matching and distance spectral radius in graphs and bipartite graphs
DOI: 10.1016/J.LAA.2022.08.034
Recommended article: Spectral radius, edge-disjoint cycles and cycles of the same length
Recommended article: Q3512064
Recommended article: Distance-regularity and the spectrum of graphs
Recommended article: On the distance spectrum of graphs
Recommended article: On the distance spectra of graphs
Recommended article: Q3743333
Recommended article: Q3983257
Recommended article: A Note on Vertex-Disjoint Cycles
Recommended article: On the distance spectrum of distance regular graphs
Recommended article: The distance spectral radius of digraphs
description: scientific article; zbMATH DE number 7597853