>
Fa   |   Ar   |   En
   classification of 3-gndb graphs  
   
نویسنده hosseini amir ,alaeiyan mehdi ,aliannejadi zohreh
منبع journal of algebra and related topics - 2025 - دوره : 13 - شماره : 1 - صفحه:53 -60
چکیده    A nonempty graph $gamma$ is called generalized 3-distance-balanced, (3-$gdb$) whenever for every edge $ab$, $|w_{ab}|=3|w_{ba}|$ or conversely. as well as a graph $gamma$ is called generalized 3-nicely distance-balanced (3-$gndb$) whenever for every edge $ab$ of $gamma$, there exists a positive integer $gamma_gamma$, such that: $|w_{ba}|=gamma_gamma$.in this paper, we classify 3-$gndb$ graphs with, $gamma_gammain {1,2}$.
کلیدواژه graphs ,generalize 3-distance-balanced graphs ,bipartite graphs
آدرس islamic azad university, nazarabad branch, department of mathematics, iran, iran university of science and technology, department of mathematics, iran, islamic azad university, south tehran branch, department of mathematics, iran
پست الکترونیکی z_alian@azad.ac.ir
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved