>
Fa   |   Ar   |   En
   1-edge contraction: total vertex stress and confluence number  
   
نویسنده shiny j. ,kok j.
منبع communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 3 - صفحه:527 -538
چکیده    This paper introduces certain relations between $1$-edge contraction and the total vertex stress and the confluence number of a graph. a main result states that if a graph $g$ with $zeta(g)=kgeq 2$ has an edge $v_iv_j$ and a $zeta$-set $mathcal{c}_g$ such that $v_i,v_jin mathcal{c}_g$ then, $zeta(g/v_iv_j) = k-1$. in general, either $mathcal{s}(g/e_i) leq mathcal{s}(g/e_j)$ or $mathcal{s}(g/e_j) leq mathcal{s}(g/e_i)$ is true. this observation leads to an investigation into the question: for which edge(s) $e_i$ will $mathcal{s}(g/e_i) = max{mathcal{s}(g/e_j):e_j in e(g)}$ and for which edge(s) will $mathcal{s}(g/e_j) = min{mathcal{s}(g/e_ell):e_ell in e(g)}$?
کلیدواژه edge contraction ,confluence number ,total vertex stress
آدرس mary matha arts and science college, mathematics research center, india, christ (deemed to be a university), visiting faculty, india. , south africa
پست الکترونیکی jacotype@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved