Zobrazeno 1 - 10
of 598
pro vyhledávání: '"Disjoint union (topology)"'
Publikováno v:
Advances in Mathematics of Communications. 17:1154-1180
Let \begin{document}$ \mathbb{F}_{q} $\end{document} be a finite field with character \begin{document}$ p $\end{document} . In this paper, the multiplicative group \begin{document}$ \mathbb{F}_{q}^{*} = \mathbb{F}_{q}\setminus\{0\} $\end{document} is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::880c9059439b70ac2f2819e2b8c70b17
https://doi.org/10.3934/amc.2021044
https://doi.org/10.3934/amc.2021044
Autor:
Kuo-Chih Hung, Shin-Hwa Wang
Publikováno v:
Journal of Differential Equations. 308:1-39
We study the diffusive generalized logistic problem with constant yield harvesting: { u ″ ( x ) + λ g ( u ) − μ = 0 , − 1 x 1 , u ( − 1 ) = u ( 1 ) = 0 , where λ , μ > 0 . We assume that g satisfies g ( 0 ) = g ( 1 ) = 0 , g ( u ) > 0 on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08fc26d5f35c7c6191fdac12edcb64ab
https://doi.org/10.1016/j.jde.2021.10.047
https://doi.org/10.1016/j.jde.2021.10.047
Autor:
Alexander Brudnyi
Publikováno v:
St. Petersburg Mathematical Journal. 32:999-1009
The maximal ideal space of the algebra of bounded holomorphic functions on the countable disjoint union of open unit disks D ⊂ C \mathbb {D}\subset \mathbb {C} is studied from a topological point of view. The results are similar to those for the ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6109ec29cffa8fbe9b0188ac166aa15
https://doi.org/10.1090/spmj/1681
https://doi.org/10.1090/spmj/1681
Autor:
I Wayan Sudarsana
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 561-566 (2021)
Let Kn be a complete graph with n vertices. For graphs G and H, the Ramsey number R(G, H) is the smallest positive integer n such that in every red-blue coloring on the edges of Kn, there is a red copy of graph G or a blue copy of graph H in Kn. Dete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c3d427122f1cfb00f7aebfa0d937973
https://ejgta.org/index.php/ejgta/article/view/1152
https://ejgta.org/index.php/ejgta/article/view/1152
Publikováno v:
Chinese Annals of Mathematics, Series B. 42:737-752
Let Z2 denote a cyclic group of 2 order and Z 2 2 = Z2 × Z2 the direct product of groups. Suppose that (M, Φ) is a closed and smooth manifold M with a smooth Z 2 2 -action whose fixed point set is the disjoint union of two real projective spaces wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b278377ee39e1067a249bccba50999e
https://doi.org/10.1007/s11401-021-0288-z
https://doi.org/10.1007/s11401-021-0288-z
Autor:
B. R. Rakshith
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 53:233-245
The adjacency matrix of a simple and undirected graph G is denoted by $${\mathcal {A}}(G)$$ and $${\mathcal {D}}_{G}$$ is the degree diagonal matrix of G. The Laplacian matrix of G is $${\mathcal {L}}(G)={\mathcal {D}}_{G}-{\mathcal {A}}(G)$$ and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83eb07d05ab5b7d1696805e0930c1413
https://doi.org/10.1007/s13226-021-00032-9
https://doi.org/10.1007/s13226-021-00032-9
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:548-557
Let $$G_n$$ and $$G'_{n}$$ be two nonisomorphic graphs on n vertices with spectra $$\begin{aligned} \lambda _{1} \geqslant \lambda _{2} \geqslant \cdots \geqslant \lambda _{n} \ \ \mathrm {and} \ \ \lambda '_{1} \geqslant \lambda '_{2} \geqslant \cdo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fa35e2bb9b960e6485c7da045ea160b
https://doi.org/10.1007/s13226-021-00058-z
https://doi.org/10.1007/s13226-021-00058-z
Publikováno v:
Linear Algebra and its Applications. 618:129-143
The energy of a graph G, E ( G ) , is the sum of absolute values of the eigenvalues of its adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices. Recall that the trace norm of a digraph D is defined as, N ( D ) = ∑
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eadd1803cfaa7eef5de3d7dee616fffe
https://doi.org/10.1016/j.laa.2021.01.026
https://doi.org/10.1016/j.laa.2021.01.026
Publikováno v:
Order. 38:283-322
Hyperplane arrangements dissect $\mathbb{R}^n$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as a sum of nonnegative integers called Whitney numbers of the first kind. His theorem generalizes to coun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bab374fc69f5589408a72f2565750730
https://doi.org/10.1007/s11083-020-09541-4
https://doi.org/10.1007/s11083-020-09541-4
Publikováno v:
Fundamenta Informaticae. 178:267-281
The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is the graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16b22c3ce7fe7d7d1c66e0ec76e65069
https://doi.org/10.3233/fi-2021-2006
https://doi.org/10.3233/fi-2021-2006