2010•Journal of Weifang UniversityRequires access

On (g

Zhang Yuan-shou

Open publisher page 0 citations

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(x0≤f(x) for every x∈V(G).A graph G is called a(g,f)-3-covered graph if any three edges of belong to a(g,f)-factor.In this paper,sufficient conditions for graphs to be covered are given.

About this research paper

What this paper is about

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(x0≤f(x) for every x∈V(G).A graph G is called a(g,f)-3-covered graph if any three edges of belong to a(g,f)-factor.In this paper,sufficient conditions for graphs to be covered are given.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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(x0≤f(x) for every x∈V(G).A graph G is called a(g,f)-3-covered graph if any three edges of belong to a(g,f)-factor.In this paper,sufficient conditions for graphs to be covered are given.

Key concepts: Combinatorics, Mathematics, Vertex (graph theory), Graph, Bound graph, Discrete mathematics, Graph power, Line graph

Related papers

Back to paper searchBrowse research topicsOriginal source
On (g — Research Paper | ScholarLens