Binding Numbers and Connected Factors

Author： Nam Yunsun  

Publisher： Springer Publishing Company

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.26, Iss.6, 2010-11, pp. : 805-813

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this paper, we obtain some sufficient conditions based on binding number for a graph to have a connected factor with degree restrictions. Let α and k be positive integers with α + k ≥ 4. Let G be a connected graph with a spanning subgraph F, each component of which has order at least α. We show that if the binding number of G is greater than (α k − α)/(α k − α −1) (k ≥ 2) and α/(α −2) (k = 1) then G has a connected subgraph which has F and in which every vertex v has degree at most deg F (v) + k. From the result, we derive various sufficient conditions for a graph to have a connected [a, b]-factor.

Related content

Connected Covering Numbers

By  

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 23, Iss. 12, 2015-12 ,pp. : 534-549 (16)

John Wiley & Sons Inc

Access to resources Recommend Favorite

Connected Covering Numbers

By  

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 1063-8539, Iss. 12, 2015-12 ,pp. : 534-549 (16)

John Wiley & Sons Inc

Access to resources Recommend Favorite

Common factors of shifted Fibonacci numbers

By Hernández Santos   Luca Florian  

Periodica Mathematica Hungarica, Vol. 47, Iss. 1-2, 2003-01 ,pp. : 95-110 (16)

Springer Publishing Company

Access to resources Recommend Favorite

Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs

By Brandt Stephan   Broersma Hajo   Diestel Reinhard   Kriesell Matthias  

Combinatorica, Vol. 26, Iss. 1, 2006-02 ,pp. : 17-36 (20)

Springer Publishing Company

Access to resources Recommend Favorite

Binding number and Hamiltonian (g, f)-factors in graphs II

By Cai Jiansheng  

International Journal of Computer Mathematics, Vol. 85, Iss. 9, 2008-09 ,pp. : 1325-1331 (7)

Taylor & Francis Ltd

Access to resources Recommend Favorite