>
Fa   |   Ar   |   En
   the edge seidel and minimum edge covering seidel energy of the k1,n and k2,n graphs  
   
نویسنده banihashemi dehkordi akram sadat ,mohammadian-semnani saeed ,alaeiyan mehdi
منبع journal of hyperstructures - 2025 - دوره : 14 - شماره : 2 - صفحه:233 -241
چکیده    The seidel energy of a graph is the sum of the absolute values of the eigenvalues of its seidel matrix. in this paper, we introduce the concepts of edge seidel energy e(ls(g)) and edge covering seidel energy e(lsec(g)) for the k1,n and k2,n graphs, and we have obtained some results.
کلیدواژه seidel energy ,seidel matrix ,line graph ,coefficient polynomial of seidel energy ,covering energy ,edge seidel energy
آدرس university of semnan, department of mathematics, statistics and computer science, iran. , university of semnan, department of mathematics, statistics and computer science, iran. , university of sciences and technology, department of mathematics, iran.
پست الکترونیکی alaeiyan@iust.ac.ir
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved