Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Landang Yuan"'
Publikováno v:
Graphs and Combinatorics. 34:555-570
A generalized strongly regular graph of grade p, as a generalization of strongly regular graphs, is a regular graph such that the number of common neighbours of both any two adjacent vertices and any two non-adjacent vertices takes on p distinct valu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2ce118c49413630862ab7f6ada8433b
https://doi.org/10.1007/s00373-018-1894-8
https://doi.org/10.1007/s00373-018-1894-8
Publikováno v:
Graphs and Combinatorics. 30:1301-1318
Let Meta(H > T, ?) denote the set of all integers v such that there exists a (H > T)-GM ? (v). In this paper, the set Meta(H > T, ?) will be completely determined for the following 21 pairs (H, T) = (H 1, P 2), (H 2, 2P 2), (H 3, P 3) and (H 4, P 4),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c52660cdec05d52aaf26d66b0e43a9b
https://doi.org/10.1007/s00373-013-1332-x
https://doi.org/10.1007/s00373-013-1332-x
Autor:
Qingde Kang, Landang Yuan
Publikováno v:
Discrete Mathematics. 310(15-16):2119-2125
The determination of the existence of large sets of Kirkman triple systems (LKTS) is a classical combinatorial problem. In this paper we introduce a new concept OLGKS—overlarge sets of generalized Kirkman triple systems and show the relationship be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b78516702fa3432f51f46c1cee14589
Autor:
Qingde Kang, Landang Yuan
Publikováno v:
Discrete Mathematics. 309:975-981
An overlarge set of KTS(v), denoted by OLKTS(v), is a collection {([email protected]?{x},B"x):[email protected]?X}, where X is a (v+1)-set, each ([email protected]?{x},B"x) is a KTS(v) and {B"x:[email protected]?X} forms a partition of all triples on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b7924eadf190dfa4f4b0e50dc648637
https://doi.org/10.1016/j.disc.2008.01.001
https://doi.org/10.1016/j.disc.2008.01.001
Autor:
Qing-de Kang, Landang Yuan
Publikováno v:
Designs, Codes and Cryptography. 48:35-42
A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection $$\{(X, \mathcal {B}_i) : 1 \leq i \leq v - 2\}$$ , where every $$(X, \mathcal {B}_i)$$ is a KTS(v) and all $$\mathcal {B}_i$$ form a partition of all triples on X.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d198b458cec05652ee45f40df6e5e35
https://doi.org/10.1007/s10623-008-9168-8
https://doi.org/10.1007/s10623-008-9168-8
Autor:
Landang Yuan, Qingde Kang
Publikováno v:
Journal of Combinatorial Designs. 16:202-212
A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection {(X, Bi) : 1 ≤ i ≤ v − 2}, where every (X,Bi) is a KTS(v) and all Bi form a partition of all triples on X. Many researchers have studied the existence of LKTS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1abf014bdfb35d0d306e7985cc0e2dac
https://doi.org/10.1002/jcd.20154
https://doi.org/10.1002/jcd.20154
Autor:
Landang Yuan, Qingde Kang
Publikováno v:
Designs, Codes & Cryptography; Jul2008, Vol. 48 Issue 1, p35-42, 8p
Publikováno v:
Graphs & Combinatorics. Jul2018, Vol. 34 Issue 4, p555-570. 16p.
Publikováno v:
Graphs & Combinatorics. Sep2014, Vol. 30 Issue 5, p1301-1318. 18p.
Autor:
Yuan, Landang, Kang, Qingde
Publikováno v:
Journal of Combinatorial Designs; 2008, Vol. 16 Issue 3, p202-212, 11p