Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Kaishun WANG"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 89-111 (2022)
We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.
Externí odkaz:
https://doaj.org/article/9fe00cf89a034a3aa735c404a4adc914
Publikováno v:
Mediators of Inflammation, Vol 2016 (2016)
Erigeron multiradiatus (Lindl.) Benth. has been used in Tibet folk medicine to treat various inflammatory diseases. The aim of this study was to investigate antimyocardial ischemia and reperfusion (I/R) injury effect of caffeoylquinic acids derivativ
Externí odkaz:
https://doaj.org/article/cf9cf18c267042489ac8fe6e2d2eaab3
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:1823-1847
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9146fe40136fca2f37c798dfcb5a0e5f
https://doi.org/10.1137/20m1357421
https://doi.org/10.1137/20m1357421
Autor:
Bin Li, Zhiye Du, Nan Jiang, Shan He, Yang Shi, Kai Xiao, Lijia Xu, Kaishun Wang, Xin Wang, Longying Wu, Ji Chen, Jin Huang
Publikováno v:
Plant Molecular Biology Reporter.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81cf630c1e873d131b15e5c974cfcad9
https://doi.org/10.1007/s11105-023-01387-5
https://doi.org/10.1007/s11105-023-01387-5
Publikováno v:
Designs, Codes and Cryptography. 88:1447-1461
Let $$\Gamma $$ be a graph with vertex set V. If a subset C of V is independent in $$\Gamma $$ and every vertex in $$V\setminus C$$ is adjacent to exactly one vertex in C, then C is called a perfect code of $$\Gamma $$. Let G be a finite group and le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1246d4e2f6fe95b09efa8860fe5a5138
https://doi.org/10.1007/s10623-020-00758-3
https://doi.org/10.1007/s10623-020-00758-3
Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F}_1\subseteq{V\brack k_1},\mathcal{F}_2\subseteq{V\brack k_2},\ldots
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb1ca4e72a543a49e41b858abfc485bb
http://arxiv.org/abs/2201.06339
http://arxiv.org/abs/2201.06339
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:1909-1921
Let $\Gamma$ be a graph with vertex set $V(\Gamma)$. A subset $C$ of $V(\Gamma)$ is called a perfect code in $\Gamma$ if $C$ is an independent set of $\Gamma$ and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$. A subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42ed8feea506f111affe824f0a6ded7a
https://doi.org/10.1137/19m1258013
https://doi.org/10.1137/19m1258013
Publikováno v:
Journal of Combinatorial Theory, Series A. 164:125-158
Let Z p s be the residue class ring of integers modulo p s , where p is a prime number and s is a positive integer. We study subspaces and Grassmann graphs for Z p s n . A Grassmann graph for Z p s n , denoted by G d ( n , m , p s ) ( G d for short),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::025be79864481eecdc46b34e9ed6cc10
https://doi.org/10.1016/j.jcta.2019.01.003
https://doi.org/10.1016/j.jcta.2019.01.003
Publikováno v:
Mathematical Reports; 2022, Vol. 24 Issue 4, p731-738, 8p
Publikováno v:
Communications in Algebra. 47:276-288
The power graph $\Gamma_G$ of a finite group $G$ is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have (non)orientable gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::890a50c61d36c53c40415e31beb4dbde
https://doi.org/10.1080/00927872.2018.1476522
https://doi.org/10.1080/00927872.2018.1476522