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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Piceno Aprutina dei Velati
2021-12-01
|
| Series: | Ratio Mathematica |
| Subjects: | |
| Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/626 |
| Summary: | 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 discussed and also we present characterization
for graph ncn(G) to be hamiltonian and eulerian. |
|---|---|
| ISSN: | 1592-7415 2282-8214 |