Document Search Results

Decomposition of the Johnson graphs into graph-pairs of order 4. (English) Zbl 07924266

Hoffman, Frederick (ed.) et al., Combinatorics, graph theory and computing. Proceedings of the 52nd Southeastern international conference, SEICCGTC 2021, virtual, Boca Raton, FL, USA, March 8–12, 2021. Singapore: Springer. Springer Proc. Math. Stat. 448, 65-71 (2024).

MSC: 05C70 05C51

Cite Review PDF

Full Text: DOI

Afzali, Fatemeh; Ghodrati, Amir Hossein; Maimani, Hamid Reza

Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes. (English) Zbl 1542.05049

J. Appl. Math. Comput. 70, No. 3, 2665-2675 (2024).

MSC: 05C15 05C50

Cite Review PDF

Full Text: DOI

Gregor, Petr; Merino, Arturo; Mütze, Torsten

The Hamilton compression of highly symmetric graphs. (English) Zbl 1539.05066

Ann. Comb. 28, No. 2, 379-437 (2024).

MSC: 05C45 05C25 94B05

Cite Review PDF

Full Text: DOI arXiv

OA License

Caughman, John S.; Herman, Ari J.; Terada, Taiyo S.

The odd girth of generalized Johnson graphs. (English) Zbl 1539.05153

Discrete Math. 347, No. 7, Article ID 113985, 5 p. (2024).

MSC: 05C99

Cite Review PDF

Full Text: DOI

Neustroeva, E. A.; Raigorodskii, A. M.

Estimates of the number of edges in subgraphs of Johnson graphs. (English. Russian original) Zbl 1536.05251

Math. Notes 115, No. 2, 223-231 (2024); translation from Mat. Zametki 115, No. 2, 266-275 (2024).

MSC: 05C30 05C12

Cite Review PDF

Full Text: DOI

Peng, Fangjie; Li, Meng; Sun, Xiaoming

Lackadaisical discrete-time quantum walk on Johnson graph. (English) Zbl 07820913

Physica A 635, Article ID 129495, 16 p. (2024).

MSC: 82-XX

Cite Review PDF

Full Text: DOI

Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann

Graphs with \(G^p\)-connected medians. (English) Zbl 1533.05231

Math. Program. 203, No. 1-2 (B), 369-420 (2024).

MSC: 05C78 90B80 90C27

Cite Review PDF

Full Text: DOI arXiv

Bespalov, Evgeny Andreevich; Mogilnykh, Ivan Yurevich; Vorob’ev, Konstantin Vasil’evich

\(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs. (English) Zbl 1543.05012

Sib. Èlektron. Mat. Izv. 20, No. 2, 1125-1149 (2023).

MSC: 05B07 05E30 05C21 05C50

Cite Review PDF

Full Text: DOI arXiv MNR

Merino, Arturo; Mütze, Torsten; Namrata

Kneser graphs are Hamiltonian. (English) Zbl 07844645

Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 963-970 (2023).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI arXiv

Ibarra, Sofía; Rivera, Luis Manuel

The automorphism groups of some token graphs. (English) Zbl 1534.05019

Proyecciones 42, No. 6, 1627-1651 (2023).

MSC: 05C60 05C76 20B25

Cite Review PDF

Full Text: DOI arXiv

Kozhevnikov, Vladislav; Zhukovskii, Maksim

Large cycles in generalized Johnson graphs. (English) Zbl 1526.05078

J. Graph Theory 104, No. 4, 904-918 (2023).

MSC: 05C38 05C12 05C81 05C30

Cite Review PDF

Full Text: DOI arXiv

Abiad, Aida; D’haeseleer, Jozefien; Haemers, Willem H.; Simoens, Robin

Cospectral mates for generalized Johnson and Grassmann graphs. (English) Zbl 1525.05106

Linear Algebra Appl. 678, 1-15 (2023).

MSC: 05C50 15A18 05C75

Cite Review PDF

Full Text: DOI arXiv

OA License

Conde, Rodolfo; Rajsbaum, Sergio

The solvability of consensus in iterated models extended with safe-consensus. (English) Zbl 07757144

Theory Comput. Syst. 67, No. 5, 901-955 (2023).

MSC: 68Mxx 68Qxx 68Wxx

Cite Review PDF

Full Text: DOI arXiv

OA License

Shekarriz, Mohammad H.; Ahmadi, Bahman; Talebpour, S. A.; Shirdareh Haghighi, M. H.

Distinguishing threshold of graphs. (English) Zbl 1522.05141

J. Graph Theory 103, No. 2, 359-377 (2023).

MSC: 05C15 05C25 05C30

Cite Review PDF

Full Text: DOI arXiv

OA License

Mogilnykh, I. Yu.; Vorob’ev, K. V.

On completely regular codes with minimum eigenvalue in geometric graphs. (English) Zbl 1518.05050

Discrete Math. 346, No. 7, Article ID 113357, 13 p. (2023).

MSC: 05C12 05C50 05C62 05C60 05B30 94B05

Cite Review PDF

Full Text: DOI arXiv

Rajsbaum, Sergio

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. (English) Zbl 1521.68065

Theor. Comput. Sci. 952, Article ID 113761, 24 p. (2023).

MSC: 68Q10 68P30 68R10 94A60

Cite Review PDF

Full Text: DOI arXiv

Mirafzal, Seyed Morteza

Some remarks on the square graph of the hypercube. (English) Zbl 1510.05060

Ars Math. Contemp. 23, No. 2, Paper No. 6, 16 p. (2023).

Reviewer: G. N. Prasanth (Alappuzha)

MSC: 05C12 05C25 94C15

Cite Review PDF

Full Text: DOI arXiv

OA License

Gregor, Petr; Merino, Arturo; Mütze, Torsten

The Hamilton compression of highly symmetric graphs. (English) Zbl 07893092

Szeider, Stefan (ed.) et al., 47th international symposium on mathematical foundations of computer science, MFCS 2022, Vienna, Austria, August 22–26, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 241, Article 54, 14 p. (2022).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI

Shubin, Ya. K.

Lower bound on the minimum number of edges in subgraphs of Johnson graphs. (English. Russian original) Zbl 1518.05088

Probl. Inf. Transm. 58, No. 4, 382-388 (2022); translation from Probl. Peredachi Inf. 58, No. 4, 95-102 (2022).

MSC: 05C30 05C12 05C62

Cite Review PDF

Full Text: DOI

Koledin, Tamara; Stanić, Zoran

Notes on Johnson and Hamming signed graphs. (English) Zbl 07691473

Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 65(113), No. 3, 303-315 (2022).

MSC: 05C50 05C22

Cite Review PDF

Tanaka, Hajime; Sabri, Mohamed; Portugal, Renato

Spatial search on Johnson graphs by continuous-time quantum walk. (English) Zbl 1508.81542

Quantum Inf. Process. 21, No. 2, Paper No. 74, 13 p. (2022).

MSC: 81P68 05C81 81Q35

Cite Review PDF

Full Text: DOI arXiv

Duursma, Iwan; Li, Xiao

Johnson graph codes. (English) Zbl 1508.94110

Des. Codes Cryptography 90, No. 12, 2923-2941 (2022).

MSC: 94B25 05E30

Cite Review PDF

Full Text: DOI arXiv

Tanaka, Hajime; Sabri, Mohamed; Portugal, Renato

Spatial search on Johnson graphs by discrete-time quantum walk. (English) Zbl 1507.81102

J. Phys. A, Math. Theor. 55, No. 25, Article ID 255304, 16 p. (2022).

MSC: 81Q35

Cite Review PDF

Full Text: DOI arXiv

Alaeiyan, Mehdi; Alaeiyan, Efat

Perfect 2-colorings of the Johnson graph \(J(9, 4)\). (English) Zbl 1496.05046

Math. Sci., Springer 16, No. 2, 133-136 (2022).

MSC: 05C15

Cite Review PDF

Full Text: DOI

Iglesias, Rodrigo; Natale, Mauro

A fast Fourier transform for the Johnson graph. (English) Zbl 1502.65288

J. Fourier Anal. Appl. 28, No. 4, Paper No. 62, 31 p. (2022).

MSC: 65T50 43A30

Cite Review PDF

Full Text: DOI arXiv

Shubin, Ya. K.

On the minimal number of edges in induced subgraphs of special distance graphs. (English. Russian original) Zbl 1492.05069

Math. Notes 111, No. 6, 961-969 (2022); translation from Mat. Zametki 111, No. 6, 929-939 (2022).

MSC: 05C30 05C12 05C60

Cite Review PDF

Full Text: DOI

Kuryatnikova, Olga; Sotirov, Renata; Vera, Juan C.

The maximum \(k\)-colorable subgraph problem and related problems. (English) Zbl 07549399

INFORMS J. Comput. 34, No. 1, 656-669 (2022).

MSC: 90-XX

Cite Review PDF

Full Text: DOI arXiv

Sinjorgo, Lennart; Sotirov, Renata

On the generalized \(\vartheta\)-number and related problems for highly symmetric graphs. (English) Zbl 1494.05048

SIAM J. Optim. 32, No. 2, 1344-1378 (2022).

MSC: 05C15 05E30 05C76 90C35

Cite Review PDF

Full Text: DOI arXiv

Adler, Isolde; Benediktsson, Bjarki Geir; Macpherson, Dugald

Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. (English) Zbl 07497775

Discrete Appl. Math. 312, 29-44 (2022).

MSC: 03C45 68Q25 05C42 05C85 05C12

Cite Review PDF

Full Text: DOI arXiv

Kozhevnikov, V. S.; Raigorodskii, A. M.; Zhukovskii, M. E.

Large cycles in random generalized Johnson graphs. (English) Zbl 1481.05141

Discrete Math. 345, No. 3, Article ID 112721, 9 p. (2022).

Reviewer: Nicolás Sanhueza-Matamala (Praha)

MSC: 05C80 05C38 05C12 60C05

Cite Review PDF

Full Text: DOI arXiv

Derevyanko, Nikita; Koshelev, Mikhail; Raigorodskii, Andrei

New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs. (English) Zbl 07912990

Nešetřil, Jaroslav (ed.) et al., Extended abstracts EuroComb 2021. European conference on combinatorics, graph theory and applications, virtual, September 6–10, 2021. Cham: Birkhäuser. Trends Math., Res. Perspect. CRM Barc. 14, 221-227 (2021).

MSC: 05Cxx

Cite Review PDF

Full Text: DOI

Dalfó, Cristina; Duque, Frank; Fabila-Monroy, Ruy; Fiol, Miquel Àngel; Huemer, Clemens; Trujillo-Negrete, Ana Laura; Zaragoza Martínez, Francisco Javier

Some results on the Laplacian spectra of token graphs. (English) Zbl 07912966

Nešetřil, Jaroslav (ed.) et al., Extended abstracts EuroComb 2021. European conference on combinatorics, graph theory and applications, virtual, September 6–10, 2021. Cham: Birkhäuser. Trends Math., Res. Perspect. CRM Barc. 14, 64-70 (2021).

MSC: 05Cxx

Cite Review PDF

Full Text: DOI

Yin, Fu-Gang; Feng, Yan-Quan; Zhou, Jin-Xin; Guo, Yu-Hong

The symmetry property of \((n,k)\)-arrangement graph. (English) Zbl 1535.05137

J. Graph Theory 98, No. 2, 234-254 (2021).

Reviewer: Houyi Yu (Chongqing)

MSC: 05C25 20B25

Cite Review PDF

Full Text: DOI

Praeger, Cheryl E.

Codes and designs in Johnson graphs with high symmetry. (English) Zbl 1504.05131

Dabrowski, Konrad K. (ed.) et al., Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 470, 321-342 (2021).

MSC: 05C25 20B25 94B60

Cite Review PDF

Full Text: Link

Mirafzal, S. Morteza

A note on the automorphism groups of Johnson graphs. (English) Zbl 1513.05196

Ars Comb. 154, 245-255 (2021).

MSC: 05C25 94C15 05C60 20B25

Cite Review PDF

Full Text: arXiv

Rajsbaum, Sergio

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. (English) Zbl 1521.68064

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 277-295 (2021).

MSC: 68Q10 68P30 68R10 94A60

Cite Review PDF

Full Text: DOI arXiv

Derevyanko, N. M.; Koshelev, M. M.

New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\). (English. Russian original) Zbl 1481.05126

Probl. Inf. Transm. 57, No. 4, 380-401 (2021); translation from Probl. Peredachi Inf. 57, No. 4, 87-109 (2021).

MSC: 05C70 05C80 05C75 68R10

Cite Review PDF

Full Text: DOI

Dubinin, N. A.

New Turán type bounds for Johnson graphs. (English. Russian original) Zbl 1481.05075

Probl. Inf. Transm. 57, No. 4, 373-379 (2021); translation from Probl. Peredachi Inf. 57, No. 4, 79-86 (2021).

MSC: 05C30 05C12

Cite Review PDF

Full Text: DOI

Pushnyakov, F. A.; Raigorodskii, A. M.

Estimate of the number of edges in subgraphs of a Johnson graph. (English. Russian original) Zbl 1478.05077

Dokl. Math. 104, No. 1, 193-195 (2021); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 499, 40-43 (2021).

MSC: 05C30 05C12 05C75

Cite Review PDF

Full Text: DOI

Cao, Mengyu; Lv, Benjian; Wang, Kaishun

On even-cycle-free subgraphs of the doubled Johnson graphs. (English) Zbl 1510.05134

Appl. Math. Comput. 403, Article ID 125763, 10 p. (2021).

MSC: 05C35 05C55

Cite Review PDF

Full Text: DOI arXiv

Alon, Noga; Cioabă, Sebastian M.; Gilbert, Brandon D.; Koolen, Jack H.; McKay, Brendan D.

Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs. (English) Zbl 1477.05057

Exp. Math. 30, No. 3, 372-382 (2021).

MSC: 05C12 05C80 05C50 05C40

Cite Review PDF

Full Text: DOI arXiv

García-Marco, Ignacio; Knauer, Kolja; Montejano, Luis Pedro

Chomp on generalized Kneser graphs and others. (English) Zbl 1473.05204

Int. J. Game Theory 50, No. 3, 603-621 (2021).

MSC: 05C57 91A05 91A46 91A43

Cite Review PDF

Full Text: DOI arXiv

Kivva, Bohdan

A characterization of Johnson and Hamming graphs and proof of Babai’s conjecture. (English) Zbl 1473.05325

J. Comb. Theory, Ser. B 151, 339-374 (2021).

MSC: 05E30 05C12

Cite Review PDF

Full Text: DOI arXiv

Dalfó, C.; Duque, F.; Fabila-Monroy, R.; Fiol, M. A.; Huemer, C.; Trujillo-Negrete, A. L.; Zaragoza Martínez, F. J.

On the Laplacian spectra of token graphs. (English) Zbl 1465.05098

Linear Algebra Appl. 625, 322-348 (2021).

MSC: 05C50 05C15 05C10

Cite Review PDF

Full Text: DOI arXiv

OA License

Konstantinova, Elena V.; Medvedev, Alexey N.

Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph. (English) Zbl 1512.05248

Inf. Process. Lett. 168, Article ID 106094, 9 p. (2021).

Reviewer: Hang Lau (Montréal)

MSC: 05C45 05C25

Cite Review PDF

Full Text: DOI arXiv

Ipatov, Mikhail

Exact modularity of line graphs of complete graphs. (English) Zbl 1459.05281

Mosc. J. Comb. Number Theory 10, No. 1, 61-75 (2021).

MSC: 05C76

Cite Review PDF

Full Text: DOI

Goldenberg, Elazar; Karthik, C. S.

Toward a general direct product testing theorem. (English) Zbl 1499.68391

ACM Trans. Comput. Theory 12, No. 1, Article No. 7, 18 p. (2020).

MSC: 68W20 68R05 68R10

Cite Review PDF

Full Text: DOI

Alaeiyan, Mehdi; Abedi, Amirabbas; Alaeiyan, Mohammadhadi

Perfect 3-colorings of the Johnson graph \(J(6, 3)\). (English) Zbl 1451.05072

Bull. Iran. Math. Soc. 46, No. 6, 1603-1612 (2020).

MSC: 05C15

Cite Review PDF

Full Text: DOI

Mirafzal, S. Morteza

On the automorphism groups of connected bipartite irreducible graphs. (English) Zbl 1451.05109

Proc. Indian Acad. Sci., Math. Sci. 130, No. 1, Paper No. 57, 14 p. (2020).

MSC: 05C25

Cite Review PDF

Full Text: DOI arXiv

Ekinci, Gülnaz Boruzanlı; Gauci, John Baptist

The super-connectivity of Johnson graphs. (English) Zbl 1450.05046

Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 12, 15 p. (2020).

MSC: 05C40 05C75

Cite Review PDF

Full Text: DOI arXiv

Potapov, V. N.; Avgustinovich, S. V.

Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs. (English. Russian original) Zbl 1448.05028

Sib. Math. J. 61, No. 5, 867-877 (2020); translation from Sib. Mat. Zh. 61, No. 5, 1087-1100 (2020).

MSC: 05B30 05C15 05C65 05D15 05B20 05B10 94A60

Cite Review PDF

Full Text: DOI arXiv

Raigorodskii, A. M.; Koshelev, M. M.

New bounds on clique-chromatic numbers of Johnson graphs. (English) Zbl 1442.05068

Discrete Appl. Math. 283, 724-729 (2020).

MSC: 05C15 05C55 05C35

Cite Review PDF

Full Text: DOI

Vorob’ev, Konstantin

On reconstruction of eigenfunctions of Johnson graphs. (English) Zbl 1435.05137

Discrete Appl. Math. 276, 166-171 (2020).

MSC: 05C50 94B25

Cite Review PDF

Full Text: DOI arXiv

Zakharov, Dmitriy

Chromatic numbers of Kneser-type graphs. (English) Zbl 1433.05131

J. Comb. Theory, Ser. A 172, Article ID 105188, 16 p. (2020).

MSC: 05C15 05C12 05C51

Cite Review PDF

Full Text: DOI arXiv

de Vries, Sven; Friedrich, Ulf; Raach, Stephen

Geometry of gross substitutes valuations. (English) Zbl 1431.91162

Discrete Appl. Math. 272, 16-23 (2020).

Reviewer: Nikolay Kyurkchiev (Plovdiv)

MSC: 91B26

Cite Review PDF

Full Text: DOI

Ashrafi, A. R.; Bretto, A.; Gholaminezhad, F.

The automorphism groups of the involution \(G\)-graph and Cayley graph. (English) Zbl 1449.05130

Southeast Asian Bull. Math. 43, No. 6, 775-789 (2019).

MSC: 05C25 20B25 20D60

Cite Review PDF

Brešar, Boštjan; Gastineau, Nicolas; Klavžar, Sandi; Togni, Olivier

Exact distance graphs of product graphs. (English) Zbl 1431.05050

Graphs Comb. 35, No. 6, 1555-1569 (2019).

MSC: 05C12 05C15 05C76

Cite Review PDF

Full Text: DOI arXiv

Heidari, Akram; Morteza Mirafzal, S.

Johnson graphs are panconnected. (English) Zbl 1420.05145

Proc. Indian Acad. Sci., Math. Sci. 129, No. 5, Paper No. 79, 5 p. (2019).

MSC: 05C70 05C40 94C15

Cite Review PDF

Full Text: DOI arXiv

Mirafzal, Seyed Morteza; Ziaee, Meysam

Some algebraic aspects of enhanced Johnson graphs. (English) Zbl 1507.05049

Acta Math. Univ. Comen., New Ser. 88, No. 2, 257-266 (2019).

MSC: 05C25 05C75 05E30

Cite Review PDF

Full Text: Link

Jajcay, Robert; Jones, Gareth A.

\(r\)-regular families of graph automorphisms. (English) Zbl 1414.05013

Eur. J. Comb. 79, 97-110 (2019).

MSC: 05A05 05C60 05C25

Cite Review PDF

Full Text: DOI

Ge, Gennian; Shangguan, Chong; Wang, Xin

Some intriguing upper bounds for separating hash families. (English) Zbl 1491.05110

Sci. China, Math. 62, No. 2, 269-282 (2019).

MSC: 05C35 05D40 94B25

Cite Review PDF

Full Text: DOI arXiv

Koolen, Jack H.; Yang, Qianqian; Yang, Jae Young

A generalization of a theorem of Hoffman. (English) Zbl 1404.05111

J. Comb. Theory, Ser. B 135, 75-95 (2019).

MSC: 05C50 05C12 05C65

Cite Review PDF

Full Text: DOI arXiv

Goldenberg, Elazar; C. S., Karthik

Towards a general direct product testing theorem. (English) Zbl 1528.68405

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 11, 17 p. (2018).

MSC: 68W20 68R05 68R10

Cite Review PDF

Full Text: DOI arXiv

Carstens, Corrie Jacobien; Kleer, Pieter

Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence. (English) Zbl 1522.60060

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 36, 18 p. (2018).

MSC: 60J10 05C80 05C07

Cite Review PDF

Full Text: DOI

Diego, Víctor; Serra, Oriol; Vena, Lluís

On a problem by Shapozenko on Johnson graphs. (English) Zbl 1402.05204

Graphs Comb. 34, No. 5, 947-964 (2018).

MSC: 05C99

Cite Review PDF

Full Text: DOI arXiv

Eldan, Ronen; Gross, Renan

Exponential random graphs behave like mixtures of stochastic block models. (English) Zbl 1407.62226

Ann. Appl. Probab. 28, No. 6, 3698-3735 (2018).

MSC: 62H30 05C80 60F10

Cite Review PDF

Full Text: DOI arXiv Euclid

Brouwer, Andries E.; Cioabă, Sebastian M.; Ihringer, Ferdinand; McGinnis, Matt

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. (English) Zbl 1397.05098

J. Comb. Theory, Ser. B 133, 88-121 (2018).

MSC: 05C50 05C12

Cite Review PDF

Full Text: DOI arXiv Link

Alaeiyan, Mohammad Hadi; Abedi, Amirabbas

Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph. (English) Zbl 1488.05170

Ars Comb. 140, 199-213 (2018).

MSC: 05C15

Cite Review PDF

Ganesan, Ashwin

On the automorphism group of a Johnson graph. (English) Zbl 1413.05154

Ars Comb. 136, 391-396 (2018).

MSC: 05C25 20B25

Cite Review PDF

Full Text: arXiv

Fallat, Shaun; Meagher, Karen; Soltani, Abolghasem; Yang, Boting

Compressed cliques graphs, clique coverings and positive zero forcing. (English) Zbl 1394.05087

Theor. Comput. Sci. 734, 119-130 (2018).

MSC: 05C69 05C70

Cite Review PDF

Full Text: DOI arXiv

Molitierno, Jason J.

Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs. (English) Zbl 1391.05175

Linear Multilinear Algebra 66, No. 6, 1153-1170 (2018).

MSC: 05C50

Cite Review PDF

Full Text: DOI

Dai, Irving

Diameter bounds and recursive properties of Full-Flag Johnson graphs. (English) Zbl 1387.05110

Discrete Math. 341, No. 7, 1932-1944 (2018).

MSC: 05C25 05C12

Cite Review PDF

Full Text: DOI

Baudier, F.; Lancien, G.; Schlumprecht, Th.

The coarse geometry of Tsirelson’s space and applications. (English) Zbl 1396.46020

J. Am. Math. Soc. 31, No. 3, 699-717 (2018).

Reviewer: Mikhail Ostrovskii (Queens)

MSC: 46B80 46B06 05C63 46B85 46B20

Cite Review PDF

Full Text: DOI arXiv

Borg, Peter

Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas. (English) Zbl 1383.05303

Discrete Math. 341, No. 5, 1331-1335 (2018).

MSC: 05D05 05C35

Cite Review PDF

Full Text: DOI arXiv

Cioabă, Sebastian M.; Haemers, Willem H.; Johnston, Travis; McGinnis, Matt

Cospectral mates for the union of some classes in the Johnson association scheme. (English) Zbl 1377.05108

Linear Algebra Appl. 539, 219-228 (2018).

MSC: 05C50 05E30 15A18

Cite Review PDF

Full Text: DOI arXiv

Bang, Sejeong

Diameter bounds for geometric distance-regular graphs. (English) Zbl 1372.05056

Discrete Math. 341, No. 1, 253-260 (2018).

MSC: 05C12 05C50

Cite Review PDF

Full Text: DOI

Kim, Kijung

The competition numbers of Johnson graphs with diameter four. (English) Zbl 1467.05192

Electron. J. Graph Theory Appl. 5, No. 2, 241-246 (2017).

MSC: 05C69 05C75

Cite Review PDF

Full Text: DOI

OA License

Chen, Zongchen; Zhao, Da

On symmetric BIBDs with the same 3-concurrence. (English) Zbl 1372.05022

Des. Codes Cryptography 85, No. 3, 425-436 (2017).

MSC: 05B05

Cite Review PDF

Full Text: DOI

Pogorilyy, S. D.; Slynko, M. S.; Rustamov, Y. I.

Research and development of Johnson’s algorithm parallel schemes in GPGPU technology. (English) Zbl 1419.68212

TWMS J. Pure Appl. Math. 8, No. 1, 12-21 (2017).

MSC: 68W10 05C85 68R10

Cite Review PDF

Carballosa, Walter; Fabila-Monroy, Ruy; Leaños, Jesús; Rivera, Luis Manuel

Regularity and planarity of token graphs. (English) Zbl 1366.05028

Discuss. Math., Graph Theory 37, No. 3, 573-586 (2017).

MSC: 05C10 05C69

Cite Review PDF

Full Text: DOI arXiv

OA License

Araujo, José; Bratten, Tim

On the spectrum of the Johnson graphs \(J(n,k,r)\). (English) Zbl 1368.05065

Platzeck, María Inés (ed.) et al., Actas del XIII congreso “Dr. Antonio A. R. Monteiro”. Bahía Blanca: Universidad Nacional del Sur, Instituto de Matemática. 57-62 (2016).

MSC: 05C25 20C30 05E10

Cite Review PDF

Jones, Gareth A.; Jajcay, Robert

Cayley properties of merged Johnson graphs. (English) Zbl 1352.05086

J. Algebr. Comb. 44, No. 4, 1047-1067 (2016).

MSC: 05C25 05E18 20B05 20B20 20B25

Cite Review PDF

Full Text: DOI arXiv

Brouwer, Andries E.; Cioabă, Sebastian M.; Haemers, Willem H.; Vermette, Jason R.

Notes on simplicial rook graphs. (English) Zbl 1339.05222

J. Algebr. Comb. 43, No. 4, 783-799 (2016).

MSC: 05C50 05C25

Cite Review PDF

Full Text: DOI arXiv

Backlinks: MO

OA License

Dai, Irving

Combinatorial properties of full-flag Johnson graphs. (English) Zbl 1478.05070

Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9538, 112-123 (2016).

MSC: 05C25

Cite Review PDF

Full Text: DOI

Araki, Yoshiaki; Horiyama, Takashi; Uehara, Ryuhei

Common unfolding of regular tetrahedron and Johnson-Zalgaller solid. (English) Zbl 1335.51027

J. Graph Algorithms Appl. 20, No. 1, 101-114 (2016).

MSC: 51M20 05C85

Cite Review PDF

Full Text: DOI

OA License

Chang, Huilan; Tsai, Yi-Tsz

Improvements on some error-tolerance pooling designs. (English) Zbl 1329.05051

Discrete Appl. Math. 200, 18-22 (2016).

MSC: 05B30

Cite Review PDF

Full Text: DOI

Changat, Manoj; Lekha, Divya Sindhu; Subhamathi, Ajitha R.

Algorithms for the remoteness function, and the median and antimedian sets in \(\ell_{1}\)-graphs. (English) Zbl 1453.05124

Int. J. Comput. Sci. Math. 6, No. 5, 480-491 (2015).

MSC: 05C85

Cite Review PDF

Full Text: DOI

Bansal, Nikhil; Pendavingh, Rudi A.; Van der Pol, Jorn G.

On the number of matroids. (English) Zbl 1363.05005

Combinatorica 35, No. 3, 253-277 (2015).

Reviewer: Ioan Tomescu (Bucureşti)

MSC: 05A16 05B35 05C69

Cite Review PDF

Full Text: DOI arXiv

Shiri, Zahra; Ashrafi, Ali Reza

Dependence polynomials of some graph operations. (English) Zbl 1327.05161

Vietnam J. Math. 43, No. 4, 755-769 (2015).

MSC: 05C31 05C76 05C90

Cite Review PDF

Full Text: DOI

Fish, W.

Binary codes and partial permutation decoding sets from the Johnson graphs. (English) Zbl 1336.94085

Graphs Comb. 31, No. 5, 1381-1396 (2015).

MSC: 94B05 05B30 05C90 05E18

Cite Review PDF

Full Text: DOI

Dobson, Edward; Malnič, Aleksander

Groups that are transitive on all partitions of a given shape. (English) Zbl 1319.05016

J. Algebr. Comb. 42, No. 2, 605-617 (2015).

MSC: 05A17 05C25 20B30

Cite Review PDF

Full Text: DOI

Lv, Benjian; Wang, Kaishun

The Terwilliger algebra of the incidence graphs of Johnson geometry. II. (English) Zbl 1318.05092

Discrete Math. 338, No. 12, 2378-2386 (2015).

MSC: 05E30

Cite Review PDF

Full Text: DOI

Alavi, Seyed Hassan

A generalisation of Johnson graphs with an application to triple factorisations. (English) Zbl 1314.05203

Discrete Math. 338, No. 11, 2026-2036 (2015).

MSC: 05C99 20B30

Cite Review PDF

Full Text: DOI

Pankov, Mark

Geometry of semilinear embeddings. Relations to graphs and codes. (English) Zbl 1332.51004

Hackensack, NJ: World Scientific (ISBN 978-981-4651-07-3/hbk; 978-981-4651-09-7/ebook). xii, 168 p. (2015).

Reviewer: Rolf Riesinger (Wien)

MSC: 51-02 51M35 05C25 05C50 15-02 15A04 94B05

Cite Review PDF

Full Text: DOI

Atik, Fouzul; Panigrahi, Pratima

On the distance spectrum of distance regular graphs. (English) Zbl 1312.05077

Linear Algebra Appl. 478, 256-273 (2015).

MSC: 05C50 05C12

Cite Review PDF

Full Text: DOI

Gavrilyuk, Alexander L.; Koolen, Jack H.

The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs. (English) Zbl 1303.05214

Linear Algebra Appl. 466, 117-140 (2015).

MSC: 05E30 05C31 05C12

Cite Review PDF

Full Text: DOI arXiv

Diego, Víctor; Serra, Oriol

A problem of Shapozenko on Johnson graphs. (English) Zbl 1338.05047

Rodríguez Velázques, Juan Alberto (ed.) et al., Extended abstracts of the IX “Jornadas de matemática discreta y algorítmica” (JMDA), Tarragona, Spain, July 7–9, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 46, 105-112, electronic only (2014).

MSC: 05C07

Cite Review PDF

Full Text: DOI arXiv

Akhmedov, Azer; Winter, Michael

Chordal and timbral morphologies using Hamiltonian cycles. (English) Zbl 1327.00014

J. Math. Music 8, No. 1, 1-24 (2014).

MSC: 00A65 05C90

Cite Review PDF

Full Text: DOI

Davis, Matt; Orrison, Michael E.; Su, Francis Edward

Voting for committees in agreeable societies. (English) Zbl 1312.91048

Crisman, Karl-Dieter (ed.) et al., The mathematics of decisions, elections, and games. AMS special sessions on the mathematics of decisions, elections, and games, Boston, MA, USA, January 4, 2012, and San Diego, CA, USA, January 11–12, 2013. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-9866-6/pbk; 978-1-4704-1930-1/ebook). Contemporary Mathematics 624, 147-157 (2014).

Reviewer: Annibal Parracho Sant’Anna (Rio de Janeiro)

MSC: 91B12 05C62 05C80

Cite Review PDF

Full Text: arXiv

Gutnova, A. K.; Makhnev, A. A.

Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\). (English. Russian original) Zbl 1304.05035

Dokl. Math. 89, No. 1, 38-41 (2014); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 454, No. 2, 145-148 (2014).

Reviewer: Ioan Tomescu (Bucureşti)

MSC: 05C12 05E30

Cite Review PDF

Full Text: DOI

Found 188 Documents (Results 1–100)

Decomposition of the Johnson graphs into graph-pairs of order 4. (English) Zbl 07924266

Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes. (English) Zbl 1542.05049

The Hamilton compression of highly symmetric graphs. (English) Zbl 1539.05066

The odd girth of generalized Johnson graphs. (English) Zbl 1539.05153

Estimates of the number of edges in subgraphs of Johnson graphs. (English. Russian original) Zbl 1536.05251

Lackadaisical discrete-time quantum walk on Johnson graph. (English) Zbl 07820913

Graphs with \(G^p\)-connected medians. (English) Zbl 1533.05231

\(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs. (English) Zbl 1543.05012

Kneser graphs are Hamiltonian. (English) Zbl 07844645

The automorphism groups of some token graphs. (English) Zbl 1534.05019

Large cycles in generalized Johnson graphs. (English) Zbl 1526.05078

Cospectral mates for generalized Johnson and Grassmann graphs. (English) Zbl 1525.05106

The solvability of consensus in iterated models extended with safe-consensus. (English) Zbl 07757144

Distinguishing threshold of graphs. (English) Zbl 1522.05141

On completely regular codes with minimum eigenvalue in geometric graphs. (English) Zbl 1518.05050

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. (English) Zbl 1521.68065

Some remarks on the square graph of the hypercube. (English) Zbl 1510.05060

The Hamilton compression of highly symmetric graphs. (English) Zbl 07893092

Lower bound on the minimum number of edges in subgraphs of Johnson graphs. (English. Russian original) Zbl 1518.05088

Notes on Johnson and Hamming signed graphs. (English) Zbl 07691473

Spatial search on Johnson graphs by continuous-time quantum walk. (English) Zbl 1508.81542

Johnson graph codes. (English) Zbl 1508.94110

Spatial search on Johnson graphs by discrete-time quantum walk. (English) Zbl 1507.81102

Perfect 2-colorings of the Johnson graph \(J(9, 4)\). (English) Zbl 1496.05046

A fast Fourier transform for the Johnson graph. (English) Zbl 1502.65288

On the minimal number of edges in induced subgraphs of special distance graphs. (English. Russian original) Zbl 1492.05069

The maximum \(k\)-colorable subgraph problem and related problems. (English) Zbl 07549399

On the generalized \(\vartheta\)-number and related problems for highly symmetric graphs. (English) Zbl 1494.05048

Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. (English) Zbl 07497775

Large cycles in random generalized Johnson graphs. (English) Zbl 1481.05141

New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs. (English) Zbl 07912990

Some results on the Laplacian spectra of token graphs. (English) Zbl 07912966

The symmetry property of \((n,k)\)-arrangement graph. (English) Zbl 1535.05137

Codes and designs in Johnson graphs with high symmetry. (English) Zbl 1504.05131

A note on the automorphism groups of Johnson graphs. (English) Zbl 1513.05196

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. (English) Zbl 1521.68064

New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\). (English. Russian original) Zbl 1481.05126

New Turán type bounds for Johnson graphs. (English. Russian original) Zbl 1481.05075

Estimate of the number of edges in subgraphs of a Johnson graph. (English. Russian original) Zbl 1478.05077

On even-cycle-free subgraphs of the doubled Johnson graphs. (English) Zbl 1510.05134

Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs. (English) Zbl 1477.05057

Chomp on generalized Kneser graphs and others. (English) Zbl 1473.05204

A characterization of Johnson and Hamming graphs and proof of Babai’s conjecture. (English) Zbl 1473.05325

On the Laplacian spectra of token graphs. (English) Zbl 1465.05098

Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph. (English) Zbl 1512.05248

Exact modularity of line graphs of complete graphs. (English) Zbl 1459.05281

Toward a general direct product testing theorem. (English) Zbl 1499.68391

Perfect 3-colorings of the Johnson graph \(J(6, 3)\). (English) Zbl 1451.05072

On the automorphism groups of connected bipartite irreducible graphs. (English) Zbl 1451.05109

The super-connectivity of Johnson graphs. (English) Zbl 1450.05046

Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs. (English. Russian original) Zbl 1448.05028

New bounds on clique-chromatic numbers of Johnson graphs. (English) Zbl 1442.05068

On reconstruction of eigenfunctions of Johnson graphs. (English) Zbl 1435.05137

Chromatic numbers of Kneser-type graphs. (English) Zbl 1433.05131

Geometry of gross substitutes valuations. (English) Zbl 1431.91162

The automorphism groups of the involution \(G\)-graph and Cayley graph. (English) Zbl 1449.05130

Exact distance graphs of product graphs. (English) Zbl 1431.05050

Johnson graphs are panconnected. (English) Zbl 1420.05145

Some algebraic aspects of enhanced Johnson graphs. (English) Zbl 1507.05049

\(r\)-regular families of graph automorphisms. (English) Zbl 1414.05013

Some intriguing upper bounds for separating hash families. (English) Zbl 1491.05110

A generalization of a theorem of Hoffman. (English) Zbl 1404.05111

Towards a general direct product testing theorem. (English) Zbl 1528.68405

Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence. (English) Zbl 1522.60060

On a problem by Shapozenko on Johnson graphs. (English) Zbl 1402.05204

Exponential random graphs behave like mixtures of stochastic block models. (English) Zbl 1407.62226

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. (English) Zbl 1397.05098

Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph. (English) Zbl 1488.05170

On the automorphism group of a Johnson graph. (English) Zbl 1413.05154

Compressed cliques graphs, clique coverings and positive zero forcing. (English) Zbl 1394.05087

Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs. (English) Zbl 1391.05175

Diameter bounds and recursive properties of Full-Flag Johnson graphs. (English) Zbl 1387.05110

The coarse geometry of Tsirelson’s space and applications. (English) Zbl 1396.46020

Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas. (English) Zbl 1383.05303