Regular factors and eigenvalues of regular graphs

DOI10.1016/J.EJC.2014.05.007zbMATH Open1297.05146OpenAlexW2046706140MaRDI QIDQ404439FDOQ404439

Authors: Xiaofeng Gu 

Publication date: 4 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.05.007

Recommendations

• Regular factors of regular graphs from eigenvalues
• Regular graphs, eigenvalues and regular factors
• Eigenvalues and [a,b]‐factors in regular graphs
• Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
• Edge-connectivity, eigenvalues, and matchings in regular graphs

zbMATH Keywords

eigenvalues\(k\)-critical graph\(t\)-edge-connected \(d\)-regular graphfactor-critical graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Cites Work

• Graph theory
• Spectra of graphs
• Title not available (Why is that?)
• Matchings in regular graphs from eigenvalues
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• A Short Proof of the Factor Theorem for Finite Graphs
• Pseudo-random graphs
• The Factors of Graphs
• Subgraphs with prescribed valencies
• Eigenvalues and perfect matchings
• Regular factors of simple regular graphs and factor-spectra
• Regular graphs, eigenvalues and regular factors
• Regular factors of regular graphs
• Perfect matchings, eigenvalues and expansion
• On factorisation of graphs
• Regular factors of regular graphs from eigenvalues
• Large matchings from eigenvalues

Cited In (19)

• Regular factors in regular graphs
• Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
• Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
• Graph toughness from Laplacian eigenvalues
• Regular factors of regular graphs from eigenvalues
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• Eigenvalues and [a,b]‐factors in regular graphs
• Regular factors of simple regular graphs and factor-spectra
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Regular graphs, eigenvalues and regular factors
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph
• Eigenvalues and parity factors in graphs with given minimum degree
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• On the matching number of \(k\)-uniform connected hypergraphs with maximum degree
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree

This page was built for publication: Regular factors and eigenvalues of regular graphs

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