>
Fa   |   Ar   |   En
   on common neighborhood graphs ii  
   
نویسنده hamzeh asma ,iranmanesh ali ,hossein-zadeh samaneh ,hossein-zadeh mohammad ali ,gutman ivan
منبع iranian journal of mathematical chemistry - 2018 - دوره : 9 - شماره : 1 - صفحه:37 -46
چکیده    Let g be a simple graph with vertex set v (g). the common neighborhood graph or congraph of g, denoted by con(g), is a graph with vertex set v (g), in which two vertices are adjacent if and only if they have at least one common neighbor in g. we compute the congraphs of some composite graphs. using these results, the congraphs of several special graphs are determined.
کلیدواژه common neighborhood graph ,congraph ,mycielski graph ,shadow graph ,hajós join
آدرس tarbiat modares university, faculty of mathematical sciences, department of mathematics, ایران, tarbiat modares university, faculty of mathematical sciences, department of mathematics, ایران, tarbiat modares university, faculty of mathematical sciences, department of mathematics, ایران, tarbiat modares university, faculty of mathematical sciences, department of mathematics, ایران, university of kragujevac, faculty of science, serbia
پست الکترونیکی gutman@kg.ac.rs
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved