Remarks on restricted fractional \((g, f)\)-factors in graphs
From MaRDI portal
Publication:6558689
DOI10.1016/j.dam.2022.07.020zbMATH Open1541.05125MaRDI QIDQ6558689
Publication date: 20 June 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
networkstability numberminimum degreefractional \((g, f)\)-factorrestricted fractional \((g, f)\)-factor
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees
- Kekulé structures of hexagonal chains -- some unusual connections
- Graph factors and factorization: 1985--2003: a survey
- Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees
- Discussions on orthogonal factorizations in digraphs
- On path-factor critical deleted (or covered) graphs
- Path factors in subgraphs
- A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Maximum fractional factors in graphs
- The statistics of dimers on a lattice
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs
- Independence number, connectivity, and r‐factors
- Stability number and [a,b‐factors in graphs]
- On k-orthogonal factorizations in networks
- An algorithmic proof of Tutte's f-factor theorem
- Some new sufficient conditions for graphs to have fractionalk-factors
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Fractional \((g,f)\)-factors of graphs
Related Items (7)
Distance signless Laplacian spectral radius for the existence of path-factors in graphs ⋮ Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs ⋮ Some results about star-factors in graphs ⋮ Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs ⋮ Characterizing spanning trees via the size or the spectral radius of graphs ⋮ An odd \([1, b\)-factor in a graph from signless Laplacian spectral radius] ⋮ On path-factor critical uniform graphs
This page was built for publication: Remarks on restricted fractional \((g, f)\)-factors in graphs
