|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 149 - Issue 6 |
| Published: Sep 2016 |
| Authors: Ahmad N. Al-Kenani, Anwar Alwardi, Omar A. Al-Attas |
10.5120/ijca2016911411
|
Ahmad N. Al-Kenani, Anwar Alwardi, Omar A. Al-Attas . On the Near-Common Neighborhood Graph of a Graph. International Journal of Computer Applications. 149, 6 (Sep 2016), 1-4. DOI=10.5120/ijca2016911411
@article{ 10.5120/ijca2016911411,
author = { Ahmad N. Al-Kenani,Anwar Alwardi,Omar A. Al-Attas },
title = { On the Near-Common Neighborhood Graph of a Graph },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 149 },
number = { 6 },
pages = { 1-4 },
doi = { 10.5120/ijca2016911411 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A Ahmad N. Al-Kenani
%A Anwar Alwardi
%A Omar A. Al-Attas
%T On the Near-Common Neighborhood Graph of a Graph%T
%J International Journal of Computer Applications
%V 149
%N 6
%P 1-4
%R 10.5120/ijca2016911411
%I Foundation of Computer Science (FCS), NY, USA
The near common-neighborhood graph of a graph G, denoted by ncn(G), is the graph on the some vertices ofG, two vertices being adjacent in ncn(G) if there is at least one vertex in G not adjacent to both of them. A graph is called near-common neighborhood graph if it is the near-common neighborhood of some graph. In this paper we introduce the near-common neighborhood of a graph, the near common neighborhood graph, near-completeness number of a graph, basic properties of these new graphs are obtained and interesting results are established.