|
Search elimination of bipartite graphs on 15 vertices
A. M. Magomedov Daghestan Scientific Centre of RAS
Abstract:
The set $M$ of all connected bipartite graphs on 15 vertices selected subset of the low-power $M_0$, such that for each graph of $M$ is a subset of $M_0$ contains an isomorphic graph.
Keywords:
bipartite graph, isomorphism, algorithm, colors.
Received: 05.05.2016 Revised: 28.06.2016 Accepted: 29.06.2016
Citation:
A. M. Magomedov, “Search elimination of bipartite graphs on 15 vertices”, Daghestan Electronic Mathematical Reports, 2016, no. 5, 20–24
Linking options:
https://www.mathnet.ru/eng/demr22 https://www.mathnet.ru/eng/demr/y2016/i5/p20
|
Statistics & downloads: |
Abstract page: | 132 | Full-text PDF : | 28 | References: | 24 |
|