Parameters and fractional factors in different settings
DOI10.1186/s13660-019-2106-7zbMath1499.05515OpenAlexW2947093386MaRDI QIDQ2067894
Wei Gao, Juan Luis García Guirao
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2106-7
graphfractional factorall fractional critical deleted graphdata transmission networkfractional critical deleted graph
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
- Studies on directed graphs. I, II
- Studies on directed graphs. III
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks
- Randomly orthogonal factorizations with constraints in bipartite networks
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
- An independent set degree condition for fractional critical deleted graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- Hamilton-connectivity of interconnection networks modeled by a product of graphs
- Remarks on orthogonal factorizations of digraphs
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs
- A sufficient condition for the existence of a k-factor excluding a given r-factor
- Random-Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs
- Some results about component factors in graphs
- Independence number, connectivity and fractional (g,f)-factors in graphs
- Flows in infinite graphs
- On the modelling of heat exchangers and heat exchanger network dynamics using bond graphs
This page was built for publication: Parameters and fractional factors in different settings
