دوره 15، شماره 2 - ( 7-1399 )
جلد 15 شماره 2 صفحات 20-13 |
برگشت به فهرست نسخه ها
چکیده:
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a
graph with vertex set V , in which two vertices are adjacent if and only if they have a
common neighbor in G. In this paper, we obtain characteristics of congraphs under
graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product,
and Graph join, and relations between Cayley graphs and its congraphs.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |