Font Size:
a
A
A
(g.f)-Factorizations (m,r)-Orthogonal To An Arbitrary Subgraph In Several Types Of Graph
Posted on:
2006-06-16
Degree:
Master
Type:
Thesis
Country:
China
Candidate:
G X Gui
Full Text:
PDF
GTID:
2120360152982848
Subject:
Applied Mathematics
Abstract/Summary:
PDF Full Text Request
This paper mainly proves the above five conclusions.Theorem 1 Let G be a (mg+m-1, mf-m+1)-graph, m,r be integer and let g(x) and f(x) be two integer-valued functions defined on V(G), such that 5/2 r-1 ≤g(x)
Keywords/Search Tags:
graph
,
bipartite graph
,
factor
,
factorization
,
(m,r)-orthogonal
PDF Full Text Request
Related items
1
The Study On Graph Factors And Related Problems
2
The K
1,k~-
-factorization Of Complete Bipartite Graphs
3
Research On Clustering Algorithm Based On Graph
4
Research On Data Query Optimization Technology Of Graph Database
5
Research On Parameters And Cycle Structures In Bipartite Graphs
6
Research On Bipartite Graph Matching Problem
7
Two Results On Bipartite Graph
8
Research On Counting The Number Of (m,n) Bipartite Cliques On Large-scale Bipartite Graph
9
Local 2 - Arc Pass Complete Bipartite Graph
10
The Investigation Of Some Problems In Ramsey Theory