Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Fayun Cao"'
Publikováno v:
Journal of Inequalities and Applications, Vol 2016, Iss 1, Pp 1-10 (2016)
Abstract In this paper, we study the extreme points and rotundity of Orlicz-Sobolev spaces. Analyzing and combining the properties of both Orlicz spaces and Sobolev spaces, we get the sufficient and necessary criteria for Orlicz-Sobolev spaces equipp
Externí odkaz:
https://doaj.org/article/8b15c9c054de42a4be3173fc4edf5dfa
Publikováno v:
ScienceAsia; 2024, Vol. 50 Issue 1, p1-7, 7p
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:3259-3267
The independence polynomial of a graph G is $$I(G;x)=\sum _{k=0}^{\alpha (G)} s_{k}\cdot x^{k}$$ , where $$s_{k}$$ and $$\alpha (G)$$ denote the number of independent sets of cardinality k and the independence number of G, respectively. We say that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a4d39132c107ea05b9e10c11abf5d2a
https://doi.org/10.1007/s40840-021-01106-x
https://doi.org/10.1007/s40840-021-01106-x
Publikováno v:
Applied Mathematics and Computation. 347:101-112
Let ∇2(G), φ(G) and ∇(G) denote the bipartite vertex frustration, bipartite edge frustration and decycling number of a graph G, respectively. In this paper, we show that ∇ 2 ( G ) = | V ( G ) | − max { α ( G − E ( B ) ) : B is a spanning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd7500dba9af02334272a29a673d81fb
https://doi.org/10.1016/j.amc.2018.10.082
https://doi.org/10.1016/j.amc.2018.10.082
Publikováno v:
Taiwanese J. Math. 24, no. 1 (2020), 1-17
A set of vertices $S$ of a connected graph $G$ is a nonseparating independent set if $S$ is independent and $G-S$ is connected. The nsis number $\mathcal{Z}(G)$ is the maximum cardinality of a nonseparating independent set of $G$. It is well known th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d2892b55d45afe29421a5ab1de54214
https://doi.org/10.11650/tjm/190303
https://doi.org/10.11650/tjm/190303
Publikováno v:
Graphs and Combinatorics. 34:1175-1184
A bipartition of the vertex set of a graph is called balanced if the sizes of the sets in the bipartition differ by at most one. Bollob $$\acute{a}$$ s and Scott proved that every regular graph with m edges admits a balanced bipartition $$V_{1}$$ , $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac57e77612a630c7998090984054690b
https://doi.org/10.1007/s00373-018-1949-x
https://doi.org/10.1007/s00373-018-1949-x
Publikováno v:
Journal of Inequalities and Applications, Vol 2016, Iss 1, Pp 1-10 (2016)
In this paper, we study the extreme points and rotundity of Orlicz-Sobolev spaces. Analyzing and combining the properties of both Orlicz spaces and Sobolev spaces, we get the sufficient and necessary criteria for Orlicz-Sobolev spaces equipped with a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8383a4f25b604fd3241a66bb1c6cfcac