We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Let Kn1;n2...;np denote the complete p-partite graph, p > 1, on n = n1+n2+...+np vertices and let n1≥ n2 ≥ ...≥ np > 0. We show that for a fixed value of n, both the spectral radius and the energy of complete p-partite graphs are minimal for complete split graph CS(n; p - 1) and are maximal for Tuŕan graph T(n; p)
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.