Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-23T01:51:01.026Z Has data issue: false hasContentIssue false

4 - Orbital Graphs and Strongly Regular Graphs

Published online by Cambridge University Press:  05 June 2016

Josef Lauri
Affiliation:
University of Malta
Raffaele Scapellato
Affiliation:
Politecnico di Milano
Get access

Summary

In this chapter we shall define and explore the most basic properties of what are called orbital graphs. We shall see that, analogously to coset graphs, any vertex-transitive graph is a (generalised) orbital graph. Moreover, this description gives us, in principle, a criterion for arc-transitivity. Consideration of a special type of orbital graph will lead us to strongly regular graphs.

Definitions and basic properties

We have seen in Chapter 1 that, given a permutation group (Γ, V), there is a natural induced action (Γ, V × V) on the ordered pairs of elements of V. We shall now study this action in more detail. First, let us henceforth, unless stated otherwise, suppose in this chapter that the action of Γ on V is transitive. Then the orbits of Γ on V × V are called orbitals. One of them is {(u, u) : uV}, because (Γ, V) is transitive. We denote this orbital by D0 and we call it the trivial orbital. We usually list the orbitals as D0,D1, …,Dr−1. The number r of orbitals of (Γ, V × V) is called the rank of (Γ, V).

The transpose AT of a subset A of V × V (and, in particular, of any orbital) is defined by AT = {(v, u) : (u, v) ∈ A}. We say that a subset A of V × V, and therefore any orbital, is self-paired when A = AT. A self-paired set containing the two arcs (u, v) and (v, u) is considered to be the edge {u, v}. Note that an orbital D is either self-paired or it contains no pair of opposite arcs. In fact, DD T ≠ Ø implies D = DT.

Obviously the rank r of (Γ, V) satisfies r ≥ 2 unless V has one element. The case r = 2 clearly corresponds to a 2-transitive permutation group, and we have already seen that such groups are not very interesting as automorphism groups of graphs. From our point of view, therefore, the first interesting case occurs when r = 3. We shall look at this particular case in more detail later in this chapter. We also note that, from now on, any orbital mentioned will be assumed to be nontrivial unless explicitly stated otherwise.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×