Acta mathematica scientia,Series A
• Articles • Next Articles
Li Jianxiang ; Yan Xiaoxia
Received:
Revised:
Contact:
Abstract: Let G be a graph, and let g and f be integer-valued functions defined on V(G) such that g(x)≤ f(x) for all x∈ V(G). A graph G is called a (g,f,H)-extendable ifafter deleting the vertices of any subgraph which is isomorphic to H the remaining subgraph of G has a (g,f)-factor. In thepaper the characterization of (g,f,H)-extendable graph is given. Furthermore, the properties of (g,f,n)-extendable graph(H=nK1) are studied.
Key words: (g,f)-factor, (g,f,H)-extendable graph
CLC Number:
Li Jianxiang ; Yan Xiaoxia. (g,f)-factors and Extendable Graphs[J].Acta mathematica scientia,Series A, 2006, 26(3): 321-328.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbA/EN/
http://121.43.60.238/sxwlxbA/EN/Y2006/V26/I3/321
Cited