Sufficient Condition for the Property of a Graph to be Bipartite

Authors

  • Rafael R. Kamalian Institute for Informatics and Automation Problems of NAS RA
  • Vahagn V. Mkrtchyan Institute for Informatics and Automation Problems of NAS RA

Abstract

A sufficient condition is found to determine when a graph with vertices on the integer sieve of Rn is bipartite. This condition can be useful in cases when the description of a graph does not contain an appropriate bipartition of the set of its vertices.

References

Harary F., Graph Theory, Addison-Wesley, Reading, MA,1969.

Konig D., Graphen und Matrizes. Mat. Fiz. Lapok., v. 38, pp.116-119, 1931.

Downloads

Published

2004-05-26

How to Cite

Kamalian, R. R., & Mkrtchyan, V. V. (2004). Sufficient Condition for the Property of a Graph to be Bipartite. Mathematical Problems of Computer Science, 23, 100–101. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/606

Issue

Vol. 23 (2004): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.