We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 05 June 2016
This chapter will deal with operations on graphs; these operations will be generically named ‘products’. The word is already in use for several known operations, like the direct product and the cartesian product. Our approach will try to be unifying; that is, we will offer a mathematical definition of what a ‘graph product’ is. All we require for such an operation is (1) to have the vertex-set as the cartesian product of the vertex-sets of the factors involved in the operation, and (2) to have adjacencies within the resulting product depending solely on the adjacencies inside the factors, according to certain given rules.
Our starting point will be the direct product (also often referred to in the literature as the categorical product), whose definition may be considered the simplest, and upon which we shall obtain all the other products as graph-theoretic unions of suitable direct products.
Most of the content of the present chapter is quite well known, but the results concerning the various graph products that we shall present will often have to be rephrased in order to be consistent with the scheme presented earlier.
We shall especially focus on how the connectedness of the product (as well as other matters, such as those concerning paths) is related to that of the factors. We shall also stress the properties of products as binary operations. Incidentally, let us recall that we consider finite graphs only. Accordingly, some refinements that make sense in the infinite case, such as the distinction between ‘weak’ and ‘strong’ products, will not be our concern. Also, the associative property shall be considered only from this finitary viewpoint.
Here is how this chapter is organised. The general definitions that are typical of our approach will be recalled in Section 6.1. The remaining sections will deal with properties of remarkable special cases, namely the direct product (Section 6.2); the cartesian, strong and lexicographic product (Section 6.3); the modular product; and the ‘Knight’ product (Section 6.4).
General products of graphs
We start with the definition of the direct product.
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.
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.
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.
