Binding number, odd \([1, b]\)-factors and the distance spectral radius

DOI10.1016/J.DAM.2024.09.032MaRDI QIDQ6648281

Yanling Hu, Yuke Zhang

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

distance spectral radiusbinding numberodd \([1, b\)-factor]

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Eigenvalues and \([1,n]\)-odd factors
• On factors with all degrees odd
• The binding number of a graph and its triangle
• Problems in algebraic combinatorics
• Binding number conditions for matching extension
• Chromatic number and the 2-rank of a graph
• Binding number and toughness for matching extension
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Perfect matchings of a graph
• Binding number, minimum degree, and cycle structure in graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Sufficient conditions for matchings
• The binding number of a graph and its Anderson number
• Binding number, \(k\)-factor and spectral radius of graphs

This page was built for publication: Binding number, odd \([1, b]\)-factors and the distance spectral radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648281)