>
Fa   |   Ar   |   En
   the diameter of the non-nilpotent graph of a finite group  
   
نویسنده lucchini andrea ,nemmi daniele
منبع transactions on combinatorics - 2020 - دوره : 9 - شماره : 2 - صفحه:111 -114
چکیده    We prove that the graph obtained from the non-nilpotent graph of a finite group by deleting the isolated vertices is connected with diameter at most 3. this bound is the best possible
کلیدواژه distance; nilpotency; hypercenter
آدرس università degli studi di padova, dipartimento di matematica “tullio levi-civita”, italy, università degli studi di padova, dipartimento di matematica “tullio levi-civita”, italy
پست الکترونیکی daniele.nemmi@studenti.unipd.it
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved