
Math General Math Forum  For general math related discussion and news 
 LinkBack  Thread Tools  Display Modes 
March 18th, 2015, 03:06 AM  #1 
Newbie Joined: Mar 2015 From: delhi Posts: 1 Thanks: 0  Eigenvalues of complete partite Graphs.
The eigenvalues of complete bipartite graph(Km,n) is given by the expression ±√m*n , 0(with multiplicity k2). Where k is number of nodes in the graph. I am looking for generalization of the expression for eigenvalues of complete npartite graphs. Does such a expression exists for complete tripartite graphs? 

Tags 
complete, eigenvalues, graphs, partite 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
complete  mared  Algebra  16  November 17th, 2014 12:01 PM 
Complete Graphs, Cycles, and Wheels, oh my!  jblaven  Computer Science  2  May 5th, 2014 10:53 AM 
Spanning kpartite graph  kriegor  Applied Math  1  April 12th, 2013 11:06 AM 
Question on isomorph Graphs and their complement Graphs  MageKnight  Applied Math  0  January 17th, 2013 10:38 PM 
weighted bipartite matching  aneuryzma  Advanced Statistics  0  June 11th, 2011 06:15 AM 