On the clique covering numbers of Johnson graphs On the clique covering numbers of Johnson graphs

We initiate a study of the vertex clique covering numbers of Johnson graphs J ( N ,  k ), the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when k ≤ 3 , and k ≥ N - 3 , and using computational methods, we provide expl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Designs, codes, and cryptography Jg. 93; H. 9; S. 3689 - 3705
1. Verfasser: Jørgensen, Søren Fuglede
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.09.2025
Springer Nature B.V
Schlagworte:
Algorithms
Apexes
Codes
Coding and Information Theory
Coding theory
Combinatorial analysis
Computer Science
Cryptology
Discrete Mathematics in Computer Science
Graphs
Integer programming
Linear programming
Optimization
Johnson graphs
Constant-weight codes
Clique covers
ISSN:0925-1022, 1573-7586
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We initiate a study of the vertex clique covering numbers of Johnson graphs J ( N ,  k ), the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when k ≤ 3 , and k ≥ N - 3 , and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of J (2 k ,  k ) when k is a small power of two.
AbstractList We initiate a study of the vertex clique covering numbers of Johnson graphs J ( N ,  k ), the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when k ≤ 3 , and k ≥ N - 3 , and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of J (2 k ,  k ) when k is a small power of two.
We initiate a study of the vertex clique covering numbers of Johnson graphs J(N, k), the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when k≤3, and k≥N-3, and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of J(2k, k) when k is a small power of two.
Author Jørgensen, Søren Fuglede
Author_xml – sequence: 1
  givenname: Søren Fuglede
  surname: Jørgensen
  fullname: Jørgensen, Søren Fuglede
  email: sfj@kvantify.dk
  organization: Kvantify
BookMark eNp9kEtPwzAQhC1UJNrCH-AUibNh7U3i-IgqnqrUC5wtx7H7UGsHO0Xi3-MSJG6c5rA7szvfjEx88JaQawa3DEDcJQY1Rwq8osDqGimekSmrBFJRNfWETEHmEQPOL8gspR0AMAQ-JbDyxbCxhdlvP45ZwqeNW78u_PHQ2piK4IrXsPEp-GIddb9Jl-Tc6X2yV786J--PD2-LZ7pcPb0s7pfUcMEHKrGVbSdQOmHKUnSN1UKIRrLG1UKLzrGm7EpEJ5mrmgqyGCk1M61xWrQG5-RmzO1jyJ-lQe3CMfp8UiGvcqkaeZm3-LhlYkgpWqf6uD3o-KUYqBMZNZJRmYz6IaMwm3A0pf7U1ca_6H9c3z5bZsM
Cites_doi 10.1137/090765596
10.1007/BF01929486
10.1109/TIT.1962.1057714
10.1201/9781420010541
10.1109/TIT.2010.2050922
10.1109/18.59932
10.3934/amc.2011.5.417
10.1109/18.887851
10.1017/CBO9781316414958
10.1002/jcd.10022
10.1109/TIT.1986.1057187
10.1080/00029890.1959.11989408
10.1109/TIT.1980.1056141
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
DBID AAYXX
CITATION
JQ2
DOI 10.1007/s10623-025-01663-3
DatabaseName CrossRef
ProQuest Computer Science Collection
DatabaseTitle CrossRef
ProQuest Computer Science Collection
DatabaseTitleList
ProQuest Computer Science Collection
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Computer Science
EISSN 1573-7586
EndPage 3705
ExternalDocumentID 10_1007_s10623_025_01663_3
GrantInformation_xml – fundername: European Innovation Council Accelerator grant
  grantid: 190124924
GroupedDBID -Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29F
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
95-
95.
95~
96X
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTD
ABFTV
ABHLI
ABHQN
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKFA
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFDZB
AFEXP
AFGCZ
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BAPOH
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9R
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZMTXR
ZWQNP
ZY4
~EX
AAYXX
ABJCF
AFFHD
AFKRA
ARAPS
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
JQ2
ID FETCH-LOGICAL-c272t-93b9bd739f7c447d8ea7778918f67a7df184d433f91f585091fc99a1cbcfa7bc3
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001502626700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-1022
IngestDate Wed Oct 01 07:02:47 EDT 2025
Sat Nov 29 07:30:34 EST 2025
Tue Sep 16 01:19:11 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Johnson graphs
Constant-weight codes
Clique covers
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c272t-93b9bd739f7c447d8ea7778918f67a7df184d433f91f585091fc99a1cbcfa7bc3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 3255866324
PQPubID 2043752
PageCount 17
ParticipantIDs proquest_journals_3255866324
crossref_primary_10_1007_s10623_025_01663_3
springer_journals_10_1007_s10623_025_01663_3
PublicationCentury 2000
PublicationDate 20250900
2025-09-00
20250901
PublicationDateYYYYMMDD 2025-09-01
PublicationDate_xml – month: 9
  year: 2025
  text: 20250900
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationSubtitle An International Journal
PublicationTitle Designs, codes, and cryptography
PublicationTitleAbbrev Des. Codes Cryptogr
PublicationYear 2025
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References AE Brouwer (1663_CR16) 1990; 36
AW Goodman (1663_CR3) 1959; 66
A Sidorenko (1663_CR13) 1995; 11
J Schönheim (1663_CR15) 1966; 1
1663_CR14
T Etzion (1663_CR5) 2011; 5
M Ramras (1663_CR1) 2011; 25
CJ Colbourn (1663_CR11) 2006
1663_CR2
PRJ Östergard (1663_CR6) 2010; 56
R Graham (1663_CR4) 1980; 26
D Applegate (1663_CR12) 2003; 11
K Zeger (1663_CR8) 2000; 46
S Johnson (1663_CR9) 1962; 8
C Godsil (1663_CR7) 2015
J Conway (1663_CR10) 1986; 32
References_xml – volume: 25
  start-page: 267
  issue: 1
  year: 2011
  ident: 1663_CR1
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/090765596
– volume: 11
  start-page: 179
  issue: 2
  year: 1995
  ident: 1663_CR13
  publication-title: Graphs Comb.
  doi: 10.1007/BF01929486
– volume: 8
  start-page: 203
  issue: 3
  year: 1962
  ident: 1663_CR9
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1962.1057714
– volume-title: Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications
  year: 2006
  ident: 1663_CR11
  doi: 10.1201/9781420010541
– volume: 56
  start-page: 3779
  issue: 8
  year: 2010
  ident: 1663_CR6
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2010.2050922
– ident: 1663_CR14
– volume: 36
  start-page: 1334
  issue: 6
  year: 1990
  ident: 1663_CR16
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.59932
– volume: 5
  start-page: 417
  issue: 3
  year: 2011
  ident: 1663_CR5
  publication-title: Adv. Math. Commun.
  doi: 10.3934/amc.2011.5.417
– volume: 46
  start-page: 2373
  issue: 7
  year: 2000
  ident: 1663_CR8
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.887851
– volume-title: Erdős-Ko-Rado Theorems: Algebraic Approaches
  year: 2015
  ident: 1663_CR7
  doi: 10.1017/CBO9781316414958
– volume: 11
  start-page: 218
  issue: 3
  year: 2003
  ident: 1663_CR12
  publication-title: J. Combin. Des.
  doi: 10.1002/jcd.10022
– volume: 1
  start-page: 363
  year: 1966
  ident: 1663_CR15
  publication-title: Studia Sci. Math. Hungar.
– volume: 32
  start-page: 337
  issue: 3
  year: 1986
  ident: 1663_CR10
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1986.1057187
– volume: 66
  start-page: 778
  issue: 9
  year: 1959
  ident: 1663_CR3
  publication-title: Am. Math. Mon.
  doi: 10.1080/00029890.1959.11989408
– ident: 1663_CR2
– volume: 26
  start-page: 37
  issue: 1
  year: 1980
  ident: 1663_CR4
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1980.1056141
SSID ssj0001302
Score 2.3934557
Snippet We initiate a study of the vertex clique covering numbers of Johnson graphs J ( N ,  k ), the smallest numbers of cliques necessary to cover the vertices of...
We initiate a study of the vertex clique covering numbers of Johnson graphs J(N, k), the smallest numbers of cliques necessary to cover the vertices of those...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 3689
SubjectTerms Algorithms
Apexes
Codes
Coding and Information Theory
Coding theory
Combinatorial analysis
Computer Science
Cryptology
Discrete Mathematics in Computer Science
Graphs
Integer programming
Linear programming
Optimization
Subtitle On the clique covering numbers of Johnson graphs
Title On the clique covering numbers of Johnson graphs
URI https://link.springer.com/article/10.1007/s10623-025-01663-3
https://www.proquest.com/docview/3255866324
Volume 93
WOSCitedRecordID wos001502626700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-7586
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001302
  issn: 0925-1022
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB60etCD1apYrZKDNw10k2UnOYpYvFjFF70t2WwCgrTSrf5-J_toq-hBbwkbwjLJZGaYme8DOLVKuCgRijthch7TmBsUjkbknGqNDrOKbAKHQzUa6bu6Kaxoqt2blGT5Ui81u5Gp5oF-ldyURHK5Cmtk7lQgbLh_eJ6_vyEVVyLsiYCxKUTdKvPzHl_N0cLH_JYWLa3NoP2__9yGrdq7ZBfVddiBFTfuQLthbmC1IndgcwmGkGY3c-zWYhf6t2NGU2ZfA7Qrs6HGk5axijukYBPPalotVqJdF3vwNLh6vLzmNa8CtwLFjGuZ6SxHqT3aOMZcOYOISkfKJ2gw9xT15bGUXkeeognyKLzV2kQ2s95gZuU-tMaTsTsAlpO-51ksjQ4ZQamN7RsKz7UwaBNE04WzRrzpWwWfkS6AkoOgUhJUWgoqlV3oNSeQ1qpUpJKCHpUEVPkunDcSX3z-fbfDvy0_gg1RHlqoH-tBazZ9d8ewbj9mL8X0pLxin7zkyMo
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1RS8MwED50CuqD06k4nZoH3zRgk9JrHkUcE7cpOmVvIU0TEKSTdfr7Tbp2m6IP-pbQEMoll7vj7r4P4FTHzAQRi6lhKqWhG1OFzLiRc06FQIPJlGwC-_14OBT3ZVNYXlW7VynJ4qVeaHZzppp6-lXnpkSc8mVYCZ3F8oj5D4_Ps_fXp-IKhD3mMTYZK1tlft7jqzma-5jf0qKFtWnX__efW7BZepfkcnodtmHJZA2oV8wNpFTkBmwswBC6WW-G3ZrvwMVdRtyU6FcP7Uq0r_F0y8iUOyQnI0tKWi1SoF3nu_DUvh5cdWjJq0A1QzahgiciSZELizoMMY2NQsRYBLGNUGFqXdSXhpxbEVgXTTiPwmohVKATbRUmmu9BLRtlZh9I6vQ9TUKuhM8IcqH0hXLhuWAKdYSomnBWiVe-TeEz5Bwo2QtKOkHJQlCSN6FVnYAsVSmX3AU9ceRR5ZtwXkl8_vn33Q7-tvwE1jqDXld2b_q3h7DOigP0tWQtqE3G7-YIVvXH5CUfHxfX7RMwMcuu
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60iujBalWsVs3Bmwa7ybKzOYpaFLUWfNDbks0mIMi2dFd_v8k-2ip6EG8JCSFMHjPDzHwfwLEKmfYCFlLNZEJ926YSmbYta5wKgRrjkmwC-_1wOBSDuSr-Itu9DkmWNQ0OpSnNz8aJOZsrfLNqmzoqVmuyBJzyRVjyXSK989cfX6Z_sQvLFWh7zOFtMlaVzfy8xlfVNLM3v4VIC83Ta_5_zxuwXlmd5Ly8JpuwoNMWNGtGB1I98BaszcET2t79FNM124LuQ0psl6g3B_lKlMv9tNNIySmSkZEhFd0WKVCws2147l09XVzTim-BKoYsp4LHIk6QC4PK9zEJtUTEUHihCVBiYqw3mPicG-EZ62VYS8MoIaSnYmUkxorvQCMdpXoXSGL_gST2uRQuUsiFVF1p3XbBJKoAUbbhpBZ1NC5hNaIZgLITVGQFFRWCingbOvVpRNUTyyJunaEwcGjzbTitpT8b_n21vb9NP4KVwWUvurvp3-7DKivOz6WYdaCRT971ASyrj_w1mxwWN-8TpBfUkg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+clique+covering+numbers+of+Johnson+graphs&rft.jtitle=Designs%2C+codes%2C+and+cryptography&rft.au=J%C3%B8rgensen%2C+S%C3%B8ren+Fuglede&rft.date=2025-09-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-1022&rft.eissn=1573-7586&rft.volume=93&rft.issue=9&rft.spage=3689&rft.epage=3705&rft_id=info:doi/10.1007%2Fs10623-025-01663-3&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-1022&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-1022&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-1022&client=summon