Prasad, Manjunath K and Soumya, K V and Sudhakara, G Algorithm for identifying (2, 2) -bipartite graphs. Advances and Applications in Discrete Mathematics. ISSN 0974-1658
![[img]](http://eprints.manipal.edu/style/images/fileicons/application_pdf.png) |
PDF
1874.pdf - Published Version Restricted to Registered users only Download (244kB) | Request a copy |
Abstract
The objective of the present paper is to provide an algorithm to identify if the given graph is (2, 2) -bipartite. In the process, we investigate some interesting properties of (2, 2) -bipartite graphs
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | (2, 2) -bipartite graphs, distance-k graph Gk , (k, d2 ) -colorable graph,neighborhood of a vertex. |
| Subjects: | Engineering > MIT Manipal > Mathematics |
| Depositing User: | MIT Library |
| Date Deposited: | 27 Jan 2017 10:42 |
| Last Modified: | 27 Jan 2017 10:42 |
| URI: | http://eprints.manipal.edu/id/eprint/148209 |
Actions (login required)
 |
View Item |
