✦ LIBER ✦

On the isomorphism problem for a family of cubic metacirculant graphs

✍ Scribed by Ngo Dac Tan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 589 KB
Volume: 151
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00100-w

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.

📜 SIMILAR VOLUMES

On the Isomorphism Problem for Finite Ca

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th

The Solution of a Problem of Godsil on C

The Solution of a Problem of Godsil on Cubic Cayley Graphs

✍ Cai Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 267 KB

In this short paper, we give a positive answer to a question of C. D. Godsil (1983, Europ. J. Combin. 4, 25 32) regarding automorphisms of cubic Cayley graphs of 2-groups: ``If Cay(G, S) is a cubic Cayley graph of a 2-group G and A=Aut Cay(G, S), does A 1 {1 imply Aut(G, S){1?'' 1998 Academic Press

A family of graphs and the degree/diamet

A family of graphs and the degree/diameter problem

✍ Geoffrey Exoo 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

A counterexample for the isomorphism-pro

A counterexample for the isomorphism-problem of polycyclic groups

✍ Klaus W. Roggenkamp; Alexander Zimmermann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 157 KB

On the max-cut problem for a planar, cub

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation

✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24 − 7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example

The isomorphism problem for Cayley digra

The isomorphism problem for Cayley digraphs on groups of prime-squared order

✍ Anne Joseph 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group, Namely, let X = Cay(G: T) be a Cayley digraph on a group G of order p2 with generating set T. We prove that X