Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs

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?)
Star-factors with large components
Factors and factorizations of graphs. Proof techniques in factor theory
On factors with given components
Insensitizing controls for a nonlinear parabolic equation with a nonlinear term involving the state and the gradient in unbounded domains
A bound on the spectral radius of graphs
An extension of Tutte's 1-factor theorem
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
Packing paths of length at least two
Maximizing the sum of the squares of the degrees of a graph
Interlacing eigenvalues and graphs
Spectral results on Hamiltonian problem
On the spectrum of an equitable quotient matrix and its application
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Some results on path-factor critical avoidable graphs
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
On path-factor critical deleted (or covered) graphs
Spectral radius and matchings in graphs
Two sufficient conditions for odd \([1,b]\)-factors in graphs
Some sufficient conditions for path-factor uniform graphs
Perfect matchings avoiding several independent edges in a star-free graph
Merging the A-and Q-spectral theories
Isolated toughness for path factors in networks
The 1-Factors of Oriented Graphs
ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
An improvement of the previous result on fractional \((a,b,k)\)-critical covered graphs
Path-factor critical covered graphs and path-factor uniform graphs
\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
The \(A_\alpha\)-spectral radius for path-factors in graphs
Remarks on restricted fractional \((g, f)\)-factors in graphs
Distance signless Laplacian spectral radius for the existence of path-factors in graphs
Independence number and minimum degree for path-factor critical uniform graphs
A spectral condition for a graph to have strong parity factors
Characterizing spanning trees via the size or the spectral radius of graphs

This page was built for publication: Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs

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