A5100684379- Advanced Graph Theory Research
- Limits and Structures in Graph Theory
- Advanced Mathematical Physics Problems
- Nonlinear Partial Differential Equations
- Graph Labeling and Dimension Problems
- Electrochemical sensors and biosensors
- Advancements in Battery Materials
- Computational Geometry and Mesh Generation
- graph theory and CDMA systems
- Markov Chains and Monte Carlo Methods
- Graph theory and applications
- Laser-Matter Interactions and Applications
- Economic theories and models
- Marine Biology and Environmental Chemistry
- Supercapacitor Materials and Fabrication
- Consumer Market Behavior and Pricing
- Robotics and Automated Systems
- Characterization and Applications of Magnetic Nanoparticles
- Electrochemical Analysis and Applications
- Dendrimers and Hyperbranched Polymers
- Advanced biosensing and bioanalysis techniques
- Extraction and Separation Processes
- Advanced Fiber Laser Technologies
- Nonlinear Waves and Solitons
- Geometric Analysis and Curvature Flows
Shandong University of Traditional Chinese Medicine
2024
Sichuan University of Science and Engineering
2022-2024
Beijing University of Posts and Telecommunications
2023
Georgia Institute of Technology
2021-2023
Vanderbilt University
2023
Nankai University
2019
Harbin University
2019
Harbin Engineering University
2019
As an essential component of wearable technology, skin adhesion plays a critical role in wide range device applications. To maintain effectiveness and safety daily use, skin...
ABSTRACT For integers , a graph is ‐stable if for every with . A recent result of Dong and Wu states that satisfies tight ; ‐tight some integer In this paper, we first prove all the only graphs are answering question Luo. We then nonnegative has at most vertices, Luo in negative.
The planar Turán number $\textrm{ex}_{\mathcal{P}}(C_{\ell},n)$ is the largest of edges in an $n$-vertex graph with no $\ell$-cycle. For each $\ell\in \{3,4,5,6\}$, upper bounds on are known that hold equality infinitely often. Ghosh, Győri, Martin, Paulos, and Xiao [arXiv:2004.14094] conjectured bound for every $\ell\ge 7$ $n$ sufficiently large. We disprove this conjecture 11$. also propose two revised versions conjecture.
Abstract We are concerned with the semi-classical states for Choquard equation $$-{\epsilon }^2\Delta v + Vv = {\epsilon }^{-\alpha }(I_\alpha *|v|^p)|v|^{p-2}v,\quad v\in H^1({\mathbb R}^N),$$ where N ⩾ 2, I α is Riesz potential order ∈ (0, − 1) and 2 ⩽ p < ( α)/( 2). When V assumed to be bounded away from zero, we construct a family of localized bound higher topological type that concentrate around local minimum points as ε → 0. These solutions obtained by combining Byeon–Wang's...
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 14 September 2020Accepted: 10 March 2021Published online: 17 May 2021Keywordsplanar triangulation, Hamiltonian cycle, bridge, Tutte pathAMS Subject Headings05C10, 05C30, 05C38, 05C40, 05C45Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
A binary program is a set of data and operations on the data. In translation, source machine will be transplanted to target machine. Also, which depend should migrated machine, so as ensure complete consistency accessed by codes codes. Firstly, method presented in this paper convert access corresponding for user-defined procedure, correctness meanwhile. Then, translation from x64 architecture RISC architecture, recovery based semantic mapping balanced stack frame proposed. problems procedure...
In this paper, we prove that any simple $\{C_3,C_5\}$-free non-empty connected graph $G$ with LLY curvature bounded below by $\kappa>0$ has the order at most $2^{\frac{2}{\kappa}}$. This upper bound is achieved if and only a hypercube $Q_d$ $\kappa=\frac{2}{d}$ for some integer $d\geq 1$.
In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ is contained in at least \frac{n-k+3}{2}\rfloor$ edges, then it Hamiltonian cycle. R\"{o}dl, Ruci\'{n}ski Szemer\'{e}di 2011 proved the conjecture true when $k=3$ large. We show this Katona-Kierstead holds $k=4$, large, $V({\cal H})$ partition $A$, $B$ such $|A|=\lceil n/2\rceil$, $|\{e\in E({\cal H}):|e \cap...