Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Rong-Ying Pan"'
Publikováno v:
Discrete Applied Mathematics. 304:23-31
In this paper, we consider trees of order n with a given number of vertices of maximum degree and solve the minimal extremal problem for the Wiener index on that class. Characteristics of the extremal structures are presented, some directly from prev
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :185-191
The signless Laplacian matrix of a graph is the sum of its degree diagonal and adjacency matrices. In this paper, we present a sharp upper bound for the spectral radius of the adjacency matrix of a graph. Then this result and other known results are
Autor:
Xiao-dong Zhang, Rong-ying Pan
Publikováno v:
Journal of Shanghai Jiaotong University (Science). 14:632-634
In this note, we show that the image of Laplcian eigenmap in 2-dimensional Edclidean space is lied in a parabola.
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence of Hamilton
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebf52d3d8dff3aff57df715d4faddf19