Parallel Clustering on the Star Graph

Author(s):  
M. Fazeli ◽  
H. Sarbazi-Azad ◽  
R. Farivar
2013 ◽  
Vol 58 (3-4) ◽  
pp. 886-897
Author(s):  
Hamid Sarbazi-Azad ◽  
Hamid R. Zarandi ◽  
Mahdi Fazeli

2020 ◽  
Vol 9 (8) ◽  
pp. 6059-6070
Author(s):  
D. Ajay ◽  
P. Chellamani
Keyword(s):  

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.


1994 ◽  
Vol 49 (3) ◽  
pp. 145-150 ◽  
Author(s):  
Zoran Jovanović ◽  
Jelena Mišić

2022 ◽  
Vol 51 ◽  
pp. 101447
Author(s):  
Xuejiao Zhao ◽  
Yong Liu ◽  
Yonghui Xu ◽  
Yonghua Yang ◽  
Xusheng Luo ◽  
...  

2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han

Sign in / Sign up

Export Citation Format

Share Document