Path factors in bipartite graphs from size or spectral radius
From MaRDI portal
Publication:6614061
DOI10.1007/S00010-024-01107-8zbMATH Open1548.0527MaRDI QIDQ6614061
Publication date: 7 October 2024
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral radius and fractional matchings in graphs
- A note on connected bipartite graphs of fixed order and size with maximal index
- Factors and factorizations of graphs. Proof techniques in factor theory
- Spectra of graphs
- Spectral radius of graphs with given matching number
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- On the first eigenvalue of bipartite graphs
- Eigenvalues and perfect matchings
- The spectral radius of trees on \(k\) pendant vertices
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- On the spectrum of an equitable quotient matrix and its application
- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- Spectral radius and matchings in graphs
- Adjacency eigenvalues of graphs without short odd cycles
- Regular Graphs, Eigenvalues and Regular Factors
- Sharp spectral inequalities for connected bipartite graphs with maximal Q-index
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Path factors of bipartite graphs
- Merging the A-and Q-spectral theories
- Graphs and matrices
- Matchings in graphs from the spectral radius
This page was built for publication: Path factors in bipartite graphs from size or spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614061)
