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 |
| _version_ | 1818943569565581312 |
|---|---|
| author | Keerthi G Mirajkar Anuradha V Deshpande |
| author_facet | Keerthi G Mirajkar Anuradha V Deshpande |
| author_sort | Keerthi G Mirajkar |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-20T07:29:25Z |
| format | Article |
| id | doaj.art-e502379897824d70afb2083a6ebe4d40 |
| institution | Directory Open Access Journal |
| issn | 1592-7415 2282-8214 |
| language | English |
| last_indexed | 2024-12-20T07:29:25Z |
| publishDate | 2021-12-01 |
| publisher | Accademia Piceno Aprutina dei Velati |
| record_format | Article |
| series | Ratio Mathematica |
| spelling | doaj.art-e502379897824d70afb2083a6ebe4d402022-12-21T19:48:27ZengAccademia Piceno Aprutina dei VelatiRatio Mathematica1592-74152282-82142021-12-0141020721310.23755/rm.v41i0.626547On the traversability of near common neighborhood graph of a graphKeerthi G Mirajkar0Anuradha V Deshpande1Department of Mathematics, Karnatak University's, Karnatak Arts College, Dharwad.Karnatak University's, Karnatak Arts College, Dharwad.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.http://eiris.it/ojs/index.php/ratiomathematica/article/view/626near common neighborhood graphhamiltonian grapheulerian graph |
| spellingShingle | Keerthi G Mirajkar Anuradha V Deshpande On the traversability of near common neighborhood graph of a graph Ratio Mathematica near common neighborhood graph hamiltonian graph eulerian graph |
| title | On the traversability of near common neighborhood graph of a graph |
| title_full | On the traversability of near common neighborhood graph of a graph |
| title_fullStr | On the traversability of near common neighborhood graph of a graph |
| title_full_unstemmed | On the traversability of near common neighborhood graph of a graph |
| title_short | On the traversability of near common neighborhood graph of a graph |
| title_sort | on the traversability of near common neighborhood graph of a graph |
| topic | near common neighborhood graph hamiltonian graph eulerian graph |
| url | http://eiris.it/ojs/index.php/ratiomathematica/article/view/626 |
| work_keys_str_mv | AT keerthigmirajkar onthetraversabilityofnearcommonneighborhoodgraphofagraph AT anuradhavdeshpande onthetraversabilityofnearcommonneighborhoodgraphofagraph |