QR Code

图的补距离矩阵谱半径的最大值(On maximal spectral radius of complementary distance matrix of graphs)

We determine the graphs with maximal spectral radius of the complementary distance matrix among simple connected graphs with fixed order and matching number and diameter less than or equal to 2.

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua: SULi(苏莉), LIHong-hai(李红海)
Hōputu: Artigo
Reo:Chinês
I whakaputaina: Zhejiang University Press 2013-01-01
Rangatū:Zhejiang Daxue xuebao. Lixue ban
Ngā marau:
Urunga tuihono:https://doi.org/10.3785/j.issn.1008-9497.2013.01.003
Ngā Tūtohu: Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!