An existence theorem on Hamiltonian (g,f)-factors in networks

DOI10.22436/JNSA.011.01.01zbMath1438.05206OpenAlexW2781255361MaRDI QIDQ5225333

Si-zhong Zhou

Publication date: 22 July 2019

Published in: Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22436/jnsa.011.01.01

zbMATH Keywords

network\((g,f)\)-factorbinding numberHamiltonian \((g,f)\)-factor

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• \(f\)-factors, complete-factors, and component-deleted subgraphs
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Some problems on factorizations with constraints in bipartite graphs
• Degree conditions for Hamiltonian graphs to have \([a,b\)-factors containing a given Hamiltonian cycle]
• Subdigraphs with orthogonal factorizations of digraphs. II
• Binding number and Hamiltonian \((g,f)\)-factors in graphs
• On Cui-Kano's Characterization Problem on Graph Factors
• Remarks on orthogonal factorizations of digraphs
• Some results about component factors in graphs
• Some new sufficient conditions for graphs to have fractionalk-factors
• Ore‐type condition for the existence of connected factors
• Subgraphs with prescribed valencies
• The binding number of a graph and its Anderson number

This page was built for publication: An existence theorem on Hamiltonian (g,f)-factors in networks