Some properties of the knödel graph w (K, 2k), k ≥ 4

R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay

Research output: Contribution to journalArticle

Abstract

Knödel graphs have, of late, come to be used as strong competitors for hypercubes in the realms of broadcasting and gossiping in interconnection networks. For an even positive integer n and 1 ≤ Δ ≤ ⌊log2 n⌋, the general Knödel graph WΔ,n is the Δ-regular bipartite graph with bipar-tition sets X = {x0, x1, …, xn −1} and Y = {y0, y1, …, yn −1} such that xj is adjacent n . The edge x to yj, yj+2 1 −1,2yj+2 2 −1, …, yj+2Δ−1−1, with2 suffixes being taken modulo2j yj+2i −1 at xj and the edge yj xj−(2i −1) at yj are called edges of dimension i at the stars centered at xj and yj respectively. In this paper, we concentrate on the Knödel graph Wk = Wk,2k with k ≥ 4. We show that for k ≥ 4, any automorphism of Wk fixes the set of 0-dimensional edges of Wk . We determine the automorphism group Aut(Wk) of Wk and show that it is isomorphic to the dihedral group D2k−1. In addition, we determine the spectrum of Wk and prove that it is never integral. As a by-product of our results, we obtain three new proofs showing that, for k ≥ 4, Wk is not isomorphic to the hyper-cube Hk of dimension k, and a new proof for the result that Wk is not edge-transitive.

Original languageEnglish
Pages (from-to)17-32
Number of pages16
JournalAustralasian Journal of Combinatorics
Volume74
Issue number1
Publication statusPublished - 01-06-2019
Externally publishedYes

Fingerprint

Graph in graph theory
Isomorphic
Gossiping
Suffix
Dihedral group
Interconnection Networks
Broadcasting
Regular Graph
Hypercube
Automorphism
Bipartite Graph
Automorphism Group
Regular hexahedron
Star
Adjacent
Integer

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Cite this

Balakrishnan, R., Paulraja, P., So, W., & Vinay, M. (2019). Some properties of the knödel graph w (K, 2k), k ≥ 4. Australasian Journal of Combinatorics, 74(1), 17-32.
Balakrishnan, R. ; Paulraja, P. ; So, Wasin ; Vinay, M. / Some properties of the knödel graph w (K, 2k), k ≥ 4. In: Australasian Journal of Combinatorics. 2019 ; Vol. 74, No. 1. pp. 17-32.
@article{fcf74e01bf924b16a5b89c700486da43,
title = "Some properties of the kn{\"o}del graph w (K, 2k), k ≥ 4",
abstract = "Kn{\"o}del graphs have, of late, come to be used as strong competitors for hypercubes in the realms of broadcasting and gossiping in interconnection networks. For an even positive integer n and 1 ≤ Δ ≤ ⌊log2 n⌋, the general Kn{\"o}del graph WΔ,n is the Δ-regular bipartite graph with bipar-tition sets X = {x0, x1, …, xn −1} and Y = {y0, y1, …, yn −1} such that xj is adjacent n . The edge x to yj, yj+2 1 −1,2yj+2 2 −1, …, yj+2Δ−1−1, with2 suffixes being taken modulo2j yj+2i −1 at xj and the edge yj xj−(2i −1) at yj are called edges of dimension i at the stars centered at xj and yj respectively. In this paper, we concentrate on the Kn{\"o}del graph Wk = Wk,2k with k ≥ 4. We show that for k ≥ 4, any automorphism of Wk fixes the set of 0-dimensional edges of Wk . We determine the automorphism group Aut(Wk) of Wk and show that it is isomorphic to the dihedral group D2k−1. In addition, we determine the spectrum of Wk and prove that it is never integral. As a by-product of our results, we obtain three new proofs showing that, for k ≥ 4, Wk is not isomorphic to the hyper-cube Hk of dimension k, and a new proof for the result that Wk is not edge-transitive.",
author = "R. Balakrishnan and P. Paulraja and Wasin So and M. Vinay",
year = "2019",
month = "6",
day = "1",
language = "English",
volume = "74",
pages = "17--32",
journal = "Australasian Journal of Combinatorics",
issn = "1034-4942",
publisher = "University of Queensland Press",
number = "1",

}

Balakrishnan, R, Paulraja, P, So, W & Vinay, M 2019, 'Some properties of the knödel graph w (K, 2k), k ≥ 4', Australasian Journal of Combinatorics, vol. 74, no. 1, pp. 17-32.

Some properties of the knödel graph w (K, 2k), k ≥ 4. / Balakrishnan, R.; Paulraja, P.; So, Wasin; Vinay, M.

In: Australasian Journal of Combinatorics, Vol. 74, No. 1, 01.06.2019, p. 17-32.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Some properties of the knödel graph w (K, 2k), k ≥ 4

AU - Balakrishnan, R.

AU - Paulraja, P.

AU - So, Wasin

AU - Vinay, M.

PY - 2019/6/1

Y1 - 2019/6/1

N2 - Knödel graphs have, of late, come to be used as strong competitors for hypercubes in the realms of broadcasting and gossiping in interconnection networks. For an even positive integer n and 1 ≤ Δ ≤ ⌊log2 n⌋, the general Knödel graph WΔ,n is the Δ-regular bipartite graph with bipar-tition sets X = {x0, x1, …, xn −1} and Y = {y0, y1, …, yn −1} such that xj is adjacent n . The edge x to yj, yj+2 1 −1,2yj+2 2 −1, …, yj+2Δ−1−1, with2 suffixes being taken modulo2j yj+2i −1 at xj and the edge yj xj−(2i −1) at yj are called edges of dimension i at the stars centered at xj and yj respectively. In this paper, we concentrate on the Knödel graph Wk = Wk,2k with k ≥ 4. We show that for k ≥ 4, any automorphism of Wk fixes the set of 0-dimensional edges of Wk . We determine the automorphism group Aut(Wk) of Wk and show that it is isomorphic to the dihedral group D2k−1. In addition, we determine the spectrum of Wk and prove that it is never integral. As a by-product of our results, we obtain three new proofs showing that, for k ≥ 4, Wk is not isomorphic to the hyper-cube Hk of dimension k, and a new proof for the result that Wk is not edge-transitive.

AB - Knödel graphs have, of late, come to be used as strong competitors for hypercubes in the realms of broadcasting and gossiping in interconnection networks. For an even positive integer n and 1 ≤ Δ ≤ ⌊log2 n⌋, the general Knödel graph WΔ,n is the Δ-regular bipartite graph with bipar-tition sets X = {x0, x1, …, xn −1} and Y = {y0, y1, …, yn −1} such that xj is adjacent n . The edge x to yj, yj+2 1 −1,2yj+2 2 −1, …, yj+2Δ−1−1, with2 suffixes being taken modulo2j yj+2i −1 at xj and the edge yj xj−(2i −1) at yj are called edges of dimension i at the stars centered at xj and yj respectively. In this paper, we concentrate on the Knödel graph Wk = Wk,2k with k ≥ 4. We show that for k ≥ 4, any automorphism of Wk fixes the set of 0-dimensional edges of Wk . We determine the automorphism group Aut(Wk) of Wk and show that it is isomorphic to the dihedral group D2k−1. In addition, we determine the spectrum of Wk and prove that it is never integral. As a by-product of our results, we obtain three new proofs showing that, for k ≥ 4, Wk is not isomorphic to the hyper-cube Hk of dimension k, and a new proof for the result that Wk is not edge-transitive.

UR - http://www.scopus.com/inward/record.url?scp=85068729305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068729305&partnerID=8YFLogxK

M3 - Article

VL - 74

SP - 17

EP - 32

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

IS - 1

ER -

Balakrishnan R, Paulraja P, So W, Vinay M. Some properties of the knödel graph w (K, 2k), k ≥ 4. Australasian Journal of Combinatorics. 2019 Jun 1;74(1):17-32.