On(g,f)-3-Deleted Graphs
Zhang Yuan-shou
Abstract
Zhang Yuan-shou
Abstract
Let G be a graph with vertex set V(G) and edge set E(G),and let and be two integer-valued functions defined on V(G) such that gf for every x∈V(G),A(g,f)-factor of G is a spanning subgraph F of G such that g(x)≤dF(x)≤f(x) for every x∈V(G).A graph G is called a(g,f)-3-deleted graph if any 3 edges e1,e2,e3 of G,G has a(g,f)-factor excluding e1,e2,e3 In this paper,sufficient conditions for graphs to be covered are given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a graph with vertex set V(G) and edge set E(G),and let and be two integer-valued functions defined on V(G) such that gf for every x∈V(G),A(g,f)-factor of G is a spanning subgraph F of G such that g(x)≤dF(x)≤f(x) for every x∈V(G).A graph G is called a(g,f)-3-deleted graph if any 3 edges e1,e2,e3 of G,G has a(g,f)-factor excluding e1,e2,e3 In this paper,sufficient conditions for graphs to be covered are given.
Key concepts: Combinatorics, Mathematics, Graph, Bound graph, Vertex (graph theory), Discrete mathematics, Graph power, Line graph