SOME PROPERTIES OF FINITE {0,1}-GRAPHS

Year 2013, Volume: 1 Issue: 1, 34 - 39, 01.06.2013

İbrahim Gunaltılı A.Ulukan Ş.Olgun

https://izlik.org/JA84JY37LB

Abstract

Let G=(V ,E) be a connected graph , X be a subset of V , Abe a finite subset of non-negative integers and n (x, y) be the total numberof neighbours of any two vertices x, y of X. The set X is called A-semisetif n (x, y) ∈ A for any two vertices x ande y of X.If X is a A-semiset,but not B-semiset for any subset B of A ,the set X is called A-set.Thegraph G=(V ,E) is a A-semigraph and A-graph if V is the A-semiset and Aset, respectively. Mulder [2] observed that {0, λ}-semigraphs(these graphs arecalled (0, λ)-graphs by Mulder [2]), (λ ≥ 2) , are regular. Furthermore a lowerbound for the degree of {0, λ}-semigraphs with diameter at least four wasderived by Mulder [2].In this paper, we determined basic properties of finite bigraphs with atleast one {0,1}-part

Keywords

graph , bipartite graph , A-semiset , convex graph

References

• A.S. Asratian,T.M.J. Denley and R. H¨oggkvist, Bipartite graphs and their applications, Cambridge Uni. Press, United Kingdom, (1998).
• M. Mulder, (0, λ)-graph and n−cubes, Discrete mathematics 28 (1979) 179- 188.
• P. Hall, On Reprensentation of Subset, J. Londan Mth. Soc. 10 (1935) 26-30
• J. Plesnik, A note on the complexcity of finding reguler subgraphs, Discrete Math., 49 (1984),16167
• F. Harary, D. Hsu and Z. Miller, The biparticity of a graph, J. Graph Theory 1 (1977) 131-133.
• A. Ulukan, On the Finite Adjacent Bipartite Graphs, PHD thesis.
• ˙I. G¨unaltılı, Finite regular bigraphs with at least one {1}-part , (preprint).
• Eskis¸ehir Osmangazi University Department of Mathematics and Computer Sciences,
• Eskis¸ehir-TURKEY E-mail address: [e-mail] E-mail address: [e-mail] E-mail address: [e-mail]