✦ LIBER ✦

Circular permutation graphs

✍ Scribed by D. Rotem; J. Urrutia

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 481 KB
Volume: 12
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230120407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm to recognize cir

A linear time algorithm to recognize circular permutation graphs

✍ Sritharan, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea

On diameter of permutation graphs

✍ Gu, Weizhen 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Let G be a connected graph with n vertices. Let a be a permutation in S n . The a-generalized graph over G, denoted by P a (G), consists of two disjoint, identical copies of G along with edges £a(£). In this paper, we investigated the relation between diameter of P a (G) and diameter of G for any pe

Circular perfect graphs

✍ Xuding Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

For 1 d k, let K k=d be the graph with vertices 0; 1; . . . ; k À 1, in which i $ j if d ji À jj k À d. The circular chromatic number c ðGÞ of a graph G is the minimum of those k=d for which G admits a homomorphism to K k=d . The circular clique number ! c ðGÞ of G is the maximum of those k=d for wh

On restricted connectivities of permutat

On restricted connectivities of permutation graphs

✍ C. Balbuena; X. Marcote; P. García-Vázquez 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

Self-clique graphs and matrix permutatio

Self-clique graphs and matrix permutations

✍ Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme L. Szwarcfiter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract The __clique graph__ of a graph is the intersection graph of its (maximal) cliques. A graph is __self‐clique__ when it is isomorphic with its clique graph, and is __clique‐Helly__ when its cliques satisfy the Helly property. We prove that a graph is clique‐Helly and self‐clique if and o

Circular Tuscan-k Arrays from Permutatio

Circular Tuscan-k Arrays from Permutation Binomials

✍ Wensong Chu; Solomon W. Golomb 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

In this paper, we first discuss some properties of permutation polynomials over finite fields. In particular, a class of permutation binomials are introduced and a series of set complete mappings is constructed. Based on that, we present a new construction for Tuscan-l arrays with various sizes.