Integral circulant graphs are a generalization of unitary Cayley graphs, recently studied by Klotz and Sander. The integral circulant graph X n (D) has vertices 0, 1, . . . , n -1, and two vertices a and b are adjacent iff gcd(xy, n) ∈ D, where D ⊆ {d : Circulant graphs have various applications in
✦ LIBER ✦
On the clique number of integral circulant graphs
✍ Scribed by Milan Bašić; Aleksandar Ilić
- Book ID
- 108052453
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 491 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the chromatic number of integral circ
✍
Aleksandar Ilić; Milan Bašić
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 395 KB
Clique numbers of graphs
✍
Paul Erdös; Marcel Erné
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 337 KB
For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus
Clique-transversal number of graphs whos
✍
Zuo-song Liang; Er-fang Shan
📂
Article
📅
2008
🏛
Chinese Electronic Periodical Services
🌐
English
⚖ 127 KB
On the clique-transversal number of chor
✍
Thomas Andreae
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 433 KB
New results on the energy of integral ci
✍
Aleksandar Ilić; Milan Bašić
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 271 KB
The Clique Numbers of Regular Graphs
✍
Narong Punnim
📂
Article
📅
2002
🏛
Springer Japan
🌐
English
⚖ 84 KB