Spectral radius and \([a,b]\)-factors in graphs (Q2138986): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2111.01367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors with all degrees odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in a hypergraph with a unique perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp conditions for the existence of an even $[a,b]$-factor in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of all generalized fractional \((g, f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonicity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum graphs with a unique k-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with a uniquek-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number and [<i>a,b</i>]‐factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional factors, component factors and isolated vertex conditions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and \([1,n]\)-odd factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified existence theorems on all fractional \([a,b]\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors of regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs, Eigenvalues and Regular Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On neighborhood condition for graphs to have [\(a\), \(b\)]-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral conditions for graphs to be β-deficient involving minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and fractional matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacian spectral radius and fractional matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with a unique perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional matching number and eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of bipartite graphs / rank
 
Normal rank

Latest revision as of 23:53, 28 July 2024

scientific article
Language Label Description Also known as
English
Spectral radius and \([a,b]\)-factors in graphs
scientific article

    Statements

    Spectral radius and \([a,b]\)-factors in graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2022
    0 references
    \([a
    0 references
    b]\)-factor
    0 references
    unique perfect matching
    0 references
    spectral radius
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references