Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Zuwen Luo"'
Publikováno v:
Contributions to Mathematics, Vol 7, Pp 1-10 (2022)
Externí odkaz:
https://doaj.org/article/f59d428af1194a07ac483ace4447661d
Publikováno v:
RAIRO - Operations Research. 56:2495-2511
For a graph G, we denote by N(G) the number of non-empty subtrees of G. If G is connected, its Wiener index W(G) is the sum of distances between all unordered pairs of vertices of G. In this paper we establish some comparative results between N and W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4df3624f7f8738f2b00c4d2171380bf
https://doi.org/10.1051/ro/2022118
https://doi.org/10.1051/ro/2022118
Autor:
Zuwen Luo, Kexiang Xu
Publikováno v:
The Electronic Journal of Combinatorics. 30
In this paper we show that for a given $k$-tree $T$ with a $k$-clique $C$, the local mean order of all sub-$k$-trees of $T$ containing $C$ is not less than the global mean order of all sub-$k$-trees of $T$, and the path-type $k$-trees have the smalle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae3b723bbb446c15de1209d3bdc619b9
https://doi.org/10.37236/11280
https://doi.org/10.37236/11280
For a tree T, the mean subtree order of T is the average order of a subtree of T. In 1984, Jamison conjectured that the mean subtree order of T decreases by at least 1/3 after contracting an edge in T. In this article we prove this conjecture in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0f6f0a8c898c20526d2b3f89dbc02e5
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-496935
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-496935
Autor:
Zuwen Luo, Liqiong Xu
Publikováno v:
The Computer Journal. 63:1372-1384
Let $G=(V(G), E(G))$ be a connected graph. A subset $T \subseteq V(G)$ is called an $R^{k}$-vertex-cut, if $G-T$ is disconnected and each vertex in $V(G)-T$ has at least $k$ neighbors in $G-T$. The cardinality of a minimum $R^{k}$-vertex-cut is the $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::862ca8c7f768b367e6470574e6eb97b2
https://doi.org/10.1093/comjnl/bxz077
https://doi.org/10.1093/comjnl/bxz077
Publikováno v:
The Computer Journal. 61:714-721
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8acfee2e3a50d6b3a9e12e6b3814ab71
https://doi.org/10.1093/comjnl/bxx100
https://doi.org/10.1093/comjnl/bxx100