On the traversability of near common neighborhood graph of a graph

Autor:	Keerthi G Mirajkar, Anuradha V Deshpande
Jazyk:	angličtina
Rok vydání:	2021
Předmět:	near common neighborhood graph hamiltonian graph eulerian graph Mathematics QA1-939 Probabilities. Mathematical statistics QA273-280
Zdroj:	Ratio Mathematica, Vol 41, Iss 0, Pp 207-213 (2021)
Druh dokumentu:	article
ISSN:	1592-7415 2282-8214
DOI:	10.23755/rm.v41i0.626
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/e502379897824d70afb2083a6ebe4d40 Zobrazit plný text záznamu View record in DOAJ