Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Edwin van Dam"'
Autor:
Edwin van Dam, Jiang Zhou
Publikováno v:
Linear Algebra and its Applications, 630, 84-94. Elsevier Inc.
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint t-cliques. The extremal graphs attaining the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ee14b36e0e7d375dd7939fc15a5b97b
https://research.tilburguniversity.edu/en/publications/8d12ecb6-c7c3-4d53-b3be-70799ab4ce79
https://research.tilburguniversity.edu/en/publications/8d12ecb6-c7c3-4d53-b3be-70799ab4ce79
Autor:
Mojtaba Jazaeri, Edwin van Dam
Publikováno v:
Ars Mathematica Contemporanea, 17(1), 203-222. Drustvo Matematikov, Fizikov in Astronomov/Society of Mathematicians, Physicists and Astronomers
We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most 4 , the Cayley graphs among the distance-regular graphs with known putative intersecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d973e423e6ff4cc2d620495458d3ba16
https://doi.org/10.26493/1855-3974.1964.297
https://doi.org/10.26493/1855-3974.1964.297
Autor:
Changxiang He, Edwin van Dam
Publikováno v:
Linear Algebra and its Applications, 536, 19-30. Elsevier Inc.
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc3b5389b6529071d1d1180fdc3f1ab1
https://doi.org/10.1016/j.laa.2017.08.012
https://doi.org/10.1016/j.laa.2017.08.012
Autor:
Pepijn Wissing, Edwin van Dam
Publikováno v:
Journal of Combinatorial Theory, Series A, Structures designs and application combinatorics, 173:105232. Academic Press Inc.
Thus far, digraphs that are uniquely determined by their Hermitian spectra have proven elusive. Instead, researchers have turned to spectral determination of classes of switching equivalent digraphs, rather than individual digraphs. In the present pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e27f0a4fa364ea6be8c187cc51461cc
https://doi.org/10.1016/j.jcta.2020.105232
https://doi.org/10.1016/j.jcta.2020.105232
Publikováno v:
Designs, Codes and Cryptography, 84(1-2), 1-2. Springer
Designs, Codes, and Cryptography, 84(1-2), 1-2. Springer Netherlands
Designs, Codes, and Cryptography, 84(1-2), 1-2. Springer Netherlands
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03c882fa404ff7aaf2621cb46a8babc7
https://research.tue.nl/nl/publications/50b52ee1-0dd6-4fbf-a291-30d0fab0b38d
https://research.tue.nl/nl/publications/50b52ee1-0dd6-4fbf-a291-30d0fab0b38d
Publikováno v:
Journal of Combinatorial Theory, Series B, Graph theory, 130, 19-48. Academic Press Inc.
An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity three. Bes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bed4a253af23eb5c55836ea4e0bc36f
http://arxiv.org/abs/1701.03193
http://arxiv.org/abs/1701.03193
Publikováno v:
Linear Algebra and its Applications. 439:2692-2710
A t-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most t. Such graphs generalize distance-regular graphs and t-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0bb48a8795785aa382d65f538208095
https://doi.org/10.1016/j.laa.2013.07.028
https://doi.org/10.1016/j.laa.2013.07.028
Publikováno v:
Journal of Combinatorial Theory, Series A, Structures designs and application combinatorics, 120(7), 1401-1439. Academic Press Inc.
Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations, including cometric Q-antipodal association schemes. After a review of imprimitivity, we show that an imprimitive association scheme is uni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3209ab1eeaf9ae9d681691491a1edb90
https://doi.org/10.1016/j.jcta.2013.04.004
https://doi.org/10.1016/j.jcta.2013.04.004
Publikováno v:
INFORMS Journal on Computing, 23(4), 493-517. INFORMS Inst.for Operations Res.and the Management Sciences
In many fields, we come across problems where we want to optimize several conflicting objectives simultaneously. To find a good solution for such multi-objective optimization problems, an approximation of the Pareto set is often generated. In this pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e0cec2afa9147350fdc13a8ce7731b2
https://doi.org/10.1287/ijoc.1100.0419
https://doi.org/10.1287/ijoc.1100.0419
Publikováno v:
Linear Algebra and its Applications. 435(10):2321-2333
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::662bd701c2ad11dbee1197674b3f3e3b