A note on the Ádám conjecture for double loops

B. Litow; B. Mans

A note on the Ádám conjecture for double loops

B. Litow, B. Mans^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

We study the condition for isomorphism between double loops (or chordal rings) which is a simple kind of circulant graph. We show that the family of n nodes double loops having chord length below min{n/4, φ(n)/2} has the Ádám property, answering partially a long-standing conjecture. We also give a simpler proof of the fact that all circulant graphs with a prime number of nodes have the Ádám property.

Original language	English
Pages (from-to)	149-153
Number of pages	5
Journal	Information Processing Letters
Volume	66
Issue number	3
Publication status	Published - 15 May 1998

Keywords

Ádám property
Circulant graphs
Graph isomorphism
Interconnection networks

Cite this

@article{3ae3f38353364f1b920d45c64af297e5,

title = "A note on the {\'A}d{\'a}m conjecture for double loops",

abstract = "We study the condition for isomorphism between double loops (or chordal rings) which is a simple kind of circulant graph. We show that the family of n nodes double loops having chord length below min\{n/4, φ(n)/2\} has the {\'A}d{\'a}m property, answering partially a long-standing conjecture. We also give a simpler proof of the fact that all circulant graphs with a prime number of nodes have the {\'A}d{\'a}m property.",

keywords = "{\'A}d{\'a}m property, Circulant graphs, Graph isomorphism, Interconnection networks",

author = "B. Litow and B. Mans",

year = "1998",

month = may,

day = "15",

language = "English",

volume = "66",

pages = "149--153",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A note on the Ádám conjecture for double loops

AU - Litow, B.

AU - Mans, B.

PY - 1998/5/15

Y1 - 1998/5/15

N2 - We study the condition for isomorphism between double loops (or chordal rings) which is a simple kind of circulant graph. We show that the family of n nodes double loops having chord length below min{n/4, φ(n)/2} has the Ádám property, answering partially a long-standing conjecture. We also give a simpler proof of the fact that all circulant graphs with a prime number of nodes have the Ádám property.

AB - We study the condition for isomorphism between double loops (or chordal rings) which is a simple kind of circulant graph. We show that the family of n nodes double loops having chord length below min{n/4, φ(n)/2} has the Ádám property, answering partially a long-standing conjecture. We also give a simpler proof of the fact that all circulant graphs with a prime number of nodes have the Ádám property.

KW - Ádám property

KW - Circulant graphs

KW - Graph isomorphism

KW - Interconnection networks

UR - https://www.scopus.com/pages/publications/0042764650

M3 - Article

AN - SCOPUS:0042764650

SN - 0020-0190

VL - 66

SP - 149

EP - 153

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

A note on the Ádám conjecture for double loops

Abstract

Keywords

Other files and links

Fingerprint

Cite this