On the traversability of near common neighborhood graph of a graph
The near common neighborhood graph of a graph G, denoted by ncn(G) is defined as the graph on the same vertices of G, two vertices are adjacent in ncn(G), if there is at least one vertex in G not adjacent to both the vertices. In this research paper, the conditions for ncn(G) to be disconnected are...
| Main Authors: | , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Accademia Piceno Aprutina dei Velati
2021-12-01
|
| 丛编: | Ratio Mathematica |
| 主题: | |
| 在线阅读: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/626 |