Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Bolian Liu"'
Publikováno v:
Linear Algebra and its Applications. 587:291-301
Let G be a connected graph with n vertices, maximum vertex degree Δ ≥ 2 and nullity η. In Q. Zhou et al. (2018) [22] , it was conjectured that η ≤ ( Δ − 2 ) n + 2 Δ − 1 and the upper bound is attained if and only if G is a cycle C n with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49d66f88ab0beb225e9b4b725aa01605
https://doi.org/10.1016/j.laa.2019.11.011
https://doi.org/10.1016/j.laa.2019.11.011
Publikováno v:
Linear Algebra and its Applications. 563:63-74
Let λ ( D ) be the A α spectral radius of digraph D, and let G n r be the set of digraphs with order n and dichromatic number r. In this paper, we characterize the digraph which has the maximal A α spectral radius in G n r . Moreover, we also dete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::489ace5f66bd682d2d122f1f8757cfaa
https://doi.org/10.1016/j.laa.2018.10.019
https://doi.org/10.1016/j.laa.2018.10.019
Publikováno v:
Discrete Mathematics. 338:159-163
Let λ ( G ) and μ ( G ) be the Laplacian and signless Laplacian spectral radius of a graph G , respectively, and let Δ ( G ) be the maximum degree of G . We call a graph G an ( n , m ) graph if G contains n vertices and m edges. In this paper, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a79a75ced1b43ce8e3b1ed3926ff916
https://doi.org/10.1016/j.disc.2014.09.007
https://doi.org/10.1016/j.disc.2014.09.007
Publikováno v:
Optimization. 64:2021-2038
Let be the set of connected simple n-vertex graphs with minimum vertex degree and maximum vertex degree . The Randic index of a graph G is defined by , where is the degree of vertex u and the summation extends over all edges uv of G. In this paper, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::470f59e76df7b88e547f9f1cbe095abc
https://doi.org/10.1080/02331934.2014.919500
https://doi.org/10.1080/02331934.2014.919500
Autor:
Bolian Liu, Muhuo Liu
Publikováno v:
Discrete Applied Mathematics. 167:217-221
Let @p=(d"1,d"2,...,d"n) and @p^'=(d"1^',d"2^',...,d"n^') be two different non-increasing degree sequences. We write @[email protected][email protected]^', if and only if @?"i"="1^nd"[email protected]?"i"="1^nd"i^', and @?"i"="1^jd"[email protected][
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80ee8b5c0a9551ebed83fa9b864df6a5
https://doi.org/10.1016/j.dam.2013.10.033
https://doi.org/10.1016/j.dam.2013.10.033
Autor:
Bolian Liu, Zhifu You
Publikováno v:
Filomat. 28:531-539
The Narumi-Katayama index of a graph G, denoted by NK(G), is defined as ?ni=1 deg(vi). In this paper, we determine the extremal NK(G) of trees, unicyclic graphs with given diameter and vertices. Moreover, the second and third minimal NK(G) of unicycl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7459498bda5a8a4ec1768c6fadae356
https://doi.org/10.2298/fil1403531y
https://doi.org/10.2298/fil1403531y
Autor:
Zhifu You, Bolian Liu
Publikováno v:
Filomat. 28:767-773
The Randiindex R(G) of a graph G is defined as R(G) = P uv2E (d(u)d(v)) 1 2 , where the summation goes over all edges of G. In 1988, Fajtlowicz proposed a conjecture: For all connected graphs G with average distance ad(G), then R(G) ad(G). In this pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1dba12749b8c46bc19ff6e962af81a5
https://doi.org/10.2298/fil1404767y
https://doi.org/10.2298/fil1404767y
Autor:
Muhuo Liu1,2 liumuhuo@scau.edu.cn, Bolian Liu2 liubl@scnu.edu.cn
Publikováno v:
Southeast Asian Bulletin of Mathematics. 2011, Vol. 35 Issue 3, p431-438. 8p.
Autor:
Liu Mu-huo1 liumuhuo@scau.edu.cn, Bolian Liu2 liubl@scnu.edu.cn
Publikováno v:
Southeast Asian Bulletin of Mathematics. 2007, Vol. 31 Issue 4, p705-712. 8p.