TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

E-ISSN： 1755-1633|81|2|350-352

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.81, Iss.2, 2010-04, pp. : 350-352

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Fitting Height and Diameter of Character Degree Graphs

By Paolo Morresi Zuccari Claudio

Communications in Algebra, Vol. 41, Iss. 8, 2013-08 ,pp. : 2869-2878

Taylor & Francis Ltd

Access to resources Recommend Favorite

An extremum problem for polynomials and bounds for codes with given distance and diameter

By Fazekas G.

Mathematical and Computer Modelling, Vol. 38, Iss. 7, 2003-10 ,pp. : 789-795

Elsevier

Access to resources Recommend Favorite

Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices

By Wang Jianfeng

Linear and Multilinear Algebra, Vol. 59, Iss. 7, 2011-07 ,pp. : 733-744

Taylor & Francis Ltd

Access to resources Recommend Favorite

WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST $6$

Bulletin of the Australian Mathematical Society, Vol. 89, Iss. 3, 2014-06 ,pp. : 379-396

Cambridge University Press

Access to resources Recommend Favorite

DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

Probability in the Engineering and Informational Sciences, Vol. 31, Iss. 1, 2016-09 ,pp. : 60-82

Cambridge University Press

Access to resources Recommend Favorite