Zobrazeno 1 - 10
of 541
pro vyhledávání: '"LIGONG WANG"'
Publikováno v:
Symmetry, Vol 16, Iss 9, p 1142 (2024)
In this paper, we study dual quaternion, dual complex unit gain graphs, and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications in robotics
Externí odkaz:
https://doaj.org/article/edc1b3ad4d754b4a81ffb348cd91ed70
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 2, p 717 (2024)
Externí odkaz:
https://doaj.org/article/f6ba8f145a4d478b92f0ab7753dd635b
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 433-441 (2021)
Let ω(G) denote the number of components of a graph G. A connected graph G is said to be 1-tough if ω(G − X)≤|X| for all X ⊆ V(G) with ω(G − X)>1. It is well-known that every hamiltonian graph is 1-tough, but that the reverse statement is
Externí odkaz:
https://doaj.org/article/b9008e7796564eafbf8314a947291779
Publikováno v:
Operators & Matrices; 2024, Vol. 18 Issue 2, p319-333, 15p
Autor:
Xiuwen Yang, Ligong Wang
Publikováno v:
Transactions on Combinatorics, Vol 10, Iss 3, Pp 187-200 (2021)
The concept of energy of a signed digraph is extended to iota energy of a signed digraph. The energy of a signed digraph $S$ is defined by $E(S)=\sum_{k=1}^n|{Re}(z_k)|$, where ${Re}(z_k)$ is the real part of eigenvalue $z_k$ and $z_k$ is
Externí odkaz:
https://doaj.org/article/8d48f4866a264ecb8df342305dc61a42
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2023, Vol. 43 Issue 2, p303-312. 10p.
Publikováno v:
BMC Ecology, Vol 20, Iss 1, Pp 1-8 (2020)
Abstract Background Clonal plants are important in maintaining wetland ecosystems. The main growth types of clonal plants are the guerrilla and phalanx types. However, little is known about the effects of these different clonal growth types on plant
Externí odkaz:
https://doaj.org/article/35106bb6eaea4340a4336cb201e2f6f9
Autor:
Ligong Wang
Publikováno v:
EURASIP Journal on Wireless Communications and Networking, Vol 2019, Iss 1, Pp 1-10 (2019)
Abstract The paper studies covert communication over a continuous-time Gaussian channel. The covertness condition requires that the channel output must statistically resemble pure noise. When the additive Gaussian noise is “white” over the bandwi
Externí odkaz:
https://doaj.org/article/28ea6721d7c04f2fb394b466502abf6a
Autor:
Weige Xi, Ligong Wang
Publikováno v:
Transactions on Combinatorics, Vol 8, Iss 4, Pp 49-60 (2019)
Let $G=(V(G),E(G))$ be a digraph without loops and multiarcs, where $V(G)=\{v_1,v_2,$ $\ldots,v_n\}$ and $E(G)$ are the vertex set and the arc set of $G$, respectively. Let $d_i^{+}$ be the outdegree of the vertex
Externí odkaz:
https://doaj.org/article/be199e979eaa41458b14f3610300c72a
Publikováno v:
Discrete Applied Mathematics. 331:1-10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70c03c2618dba15d3ff4d01079bd1902
https://doi.org/10.1016/j.dam.2023.01.014
https://doi.org/10.1016/j.dam.2023.01.014