International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 149 - Number 6 |
Year of Publication: 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
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.