>
Fa   |   Ar   |   En
   On Wiener index of graph complements  
   
نویسنده سنباگامامار جیسانکار ,بابوجی جایاپال باسکار ,گوتمن ایوان
منبع transactions on combinatorics - 2014 - دوره : 3 - شماره : 2 - صفحه:11 -15
چکیده    Let g be an (n;m)-graph. we say that g has property () if for every pair of its adjacentvertices x and y, there exists a vertex z, such that z is not adjacent to either x or y. if the graph ghas property (), then its complement g is connected, has diameter 2, and its wiener index is equalto ??n2+ m, i.e., the wiener index is insensitive of any other structural details of the graph g. wecharacterize numerous classes of graphs possessing property (), among which are trees, regular, andunicyclic graphs.
کلیدواژه distance (in graphs) ,Wiener index ,complement (of graph)
آدرس Anna University, Department of Mathematics, Anna University, Chennai{600025, India, India, Anna University, Department of Mathematics, Anna University, Chennai{600025, India, India, University of Kragujevac, Faculty of Science, University of Kragujevac, P B Box 60, 34000 Kragujevac, Serbia, Serbia
پست الکترونیکی gutman@kg.ac.rs
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved