Finite Regular {0,1}-bigraphs


2nd Cyprus International Conference on Educational Research (CY-ICER), CYPRUS, 14 - 16 February 2013, vol.89, pp.529-532 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 89
  • Doi Number: 10.1016/j.sbspro.2013.08.888
  • Country: CYPRUS
  • Page Numbers: pp.529-532
  • Eskisehir Osmangazi University Affiliated: Yes


A {0,1}- bigraph is a connected bigraph with the property that any two distinct vertices have exactly one common neighbour or none at all. If any two distinct vertices of a part P of G have exactly one common neighbour, the part P is called {1}-part. In this paper, basic properties of finite regular {0, 1}-bigraphs with at least one {1}-part are studied and some characterization results are given. (C) 2013 The Authors. Published by Elsevier Ltd.