Abstract
An -labeling of a graph is a function f from the vertex set to the set of nonnegative integers such that the labels on adjacent vertices differ by at least d and the labels on vertices at distance two differ by at least one, where . The span of f is the difference between the largest and the smallest numbers in . The -number of G, denoted by , is the minimum span over all -labelings of G. We prove that , with equality if , for direct graph bundle and Cartesian graph bundle , if certain conditions are imposed on the lengths of the cycles and on the cyclic ℓ-shift .
Keywords:
MSC:
05C15; 05C69
1. Introduction
The Frequency Assignment Problem (FAP) is a combinatorial optimization problem that arises in the field of telecommunications and radio frequency (RF) engineering. The goal of the FAP is to assign a set of communication frequencies to a set of transmitters while satisfying certain constraints and minimizing interference. This problem was first formulated as a graph-coloring problem in 1980 by Hale []. According to Roberts [], in order to avoid interference, any two “close” transmitters must receive different channels, and any two “very close” transmitters must receive channels that are at least two channels apart. To translate the problem into the language of graph theory, the transmitters are represented by the vertices of a graph; two vertices are “very close” if they are adjacent and “close” if they are at a distance of two in the graph. Based on this problem, Griggs and Yeh [] introduced -labeling on a simple graph.
Formally, an -labeling of a graph G is an assignment f of non-negative integers to vertices of G such that
where . The difference between the largest label and the smallest label assigned by f is called the span of f, and the minimum span over all -labeling of G is called the -number of G, denoted by . The general problem of determining is -hard [].
Griggs and Yeh [] put forward a conjecture that for any graph G with the maximum degree . They proved that for a general graph with the maximum degree . Later, Chang and Kuo [] improved the bound to while Král’ and Škrekovski [] further reduced the bound to . Furthermore, in 2005, Gonçalves [] announced the bound ; the conjecture is still open. The -labeling has recently been extensively studied by many researchers; the common trend is either to determine the value of the -labeling number or to suggest bounds for particular classes of graphs.
Graph products are one of the natural constructions that develop more complex graphs from simple ones. Graph bundles [,], also called twisted products, are a generalization of product graphs; these have been (under various names) frequently used as computer topologies or communication networks. A famous example is the ILIAC IV supercomputer []. While the labeling problem of Cartesian and direct products is well studied [,,,,,,,], much less is known about the labeling problem of Cartesian and direct graph bundles [,].
The central result of this paper is that, for certain direct graph bundles and certain Cartesian graph bundles , where is a cyclic ℓ-shift, the preceding lower bound corresponds to the exact value of . An analogous result is found with respect to the -numbering of direct products of cycles and Cartesian products of cycles [].
The rest of the paper is organized as follows. In the Section 2, we provide the basic definitions and some preliminary observations that are needed to outline our results. Section 3 deals with the -numbering of direct graph bundle cycles over cycles, while Section 4 presents analogous results for Cartesian graph bundle cycles over cycles. The methods of attack are similar.
2. Terminology and Preliminaries
A finite, simple, and undirected graph comprises a set of vertices and a set of edges . As usual, the edge is denoted by . Although here we are interested in undirected graphs, the order of the vertices will sometimes be important; for example, when we will assign automorphisms to the edges of the base graph. In such cases, we assign two opposite arcs to edge .
Two graphs, G and H, are called isomorphic, denoted by the symbols , if there exists a bijection from onto that preserves the adjacency and nonadjacency. In other words, a bijection is an isomorphism when if and only if . An isomorphism of a graph G onto itself is called an automorphism. The identity automorphism on G will be denoted by or .
The cycle on n vertices is defined by and if . denotes the path on distinct vertices with edges if For a graph the distance , or , between vertices u and v is defined as the number of edges on the shortest -path.
The automorphisms of a cycle have two types: a cyclic shift in the cycle by ℓ elements will be referred to as cyclic ℓ-shift and reflections with one, two, or no fixed points (depending on the parity of n). We will focus on the first type. A cyclic ℓ-shift, denoted by , , is defined as for . As a special case, we have the identity ().
Let and be connected graphs. The direct product and the Cartesian product of G and H are defined as follows: ; and . For more information on the direct and the Cartesian products of graphs, we refer to [].
Let B and G be graphs, and be the set of automorphisms of G. To any ordered pair of adjacent vertices we will assign an automorphism of G. Formally, let . For brevity, we will write and assume that for any .
Now, we construct the graphs and as follows. The vertex set of and is the Cartesian product of vertex sets, . The edges of are obtained using the following rule: for any and any , the vertices and are adjacent in . We refer to as a direct graph bundle with base B and fibre G, and write . The edges of are obtained using the following rule: for any and any , the vertices and are adjacent in , and for any and any , the vertices and are adjacent in . We refer to as a Cartesian graph bundle with base B and fibre G, and write .
Clearly, if all are identity automorphisms, the direct graph bundle is isomorphic to the direct product and the Cartesian graph bundle is isomorphic to the Cartesian product .
A graph bundle over a cycle can always be constructed in such a way that all but, at most, one automorphism are identities. Fixing , let us denote , for , and write and . In this article, we will frequently use this fact.
A graph bundle can also be represented as the graph obtained from the product by adding a copy of between vertex sets and , such that if and is adjacent to in , then and are connected by an edge in . Similarly, the graph bundle can be represented by the product by adding a copy of between vertex sets and .
We shall need the following lemma; see [].
Lemma 1.
If G is a graph with maximum degree Δ and G includes a vertex with Δ neighbours, each of which is of degree Δ, then , where .
The following facts will also be useful in the sequel.
Claim 1.
If and n are integers with , then or .
Corollary 1.
If and n are integers with , then .
Corollary 2.
If and n are integers with , then or .
3. Direct Graph Bundle
Theorem 1.
Let , and . Let be a direct graph bundle with fibre and base . If n is a multiple of s and ℓ has the form of or of , where and , then , with equality if .
Proof.
To prove this theorem, we will present several labelings of X. We will define four labelings of X using labels according to the cyclic ℓ-shift . Let .
- (i)
- Let , where and . Define labeling of v as
- (ii)
- Let , where and . Define labeling of v as
All assignments are clearly well-defined.
- Since can be represented as the graph obtained from the product by adding edges between vertex sets and (i.e., edges corresponding to the nontrivial automorphism ), first observe the product .Let X have the labeling . Then, v can be assigned the integerLet w be a vertex adjacent to v in , so w is of the form with one of the following properties:
- (a)
- ,
- (b)
- ,
- (c)
- .
It is clear thatCorollary 1 can be used to show that ; therefore, it is sufficient to show thatand, through symmetry, if X has the labeling , thenThe reader can easily verify that .Let z be a vertex, at twice the distance from v in . Then, z takes the form , with one of the following properties:- (a)
- , and are not all zero;
- (b)
- , and are not all zero;
- (c)
- , and are not all zero.
Let X have the labeling . Note that z receives the labelTo show that , it is enough to show, via Corollary 1, thatand, if X has labeling , thatSince , the following hold: - We will now consider the edges between the fiber over and the fiber over 0 in . These are edges , where and or, in another form, , where and (recall that and ).
- (a)
- First, let us consider two adjacent vertices, one from the fiber over and the other from the fiber over 0. Let X has labeling and let . If w is a neighbour from the fiber over 0, then w is of the form , where and for some . Then,andTo show that , it is sufficient to show thatthrough Corollary 1.Because for some , there exists such that . Hence,For , we can receiveand forSince and the claim is true according to Corollary 2.Let X have the labeling . Then, for some , and for adjacent vertices and , we need to show thatNote thatFor , we obtainand forSince and , the desired result follows.
- (b)
- Finally, observe vertices at a distance of two, where the shortest path between them contains at least one edge between the fiber over and the fiber over 0. Let v and z be two such vertices. We claim that the label of v is not equal to the label of z.First, let v and z be vertices from the fiber over (this is analogous if both vertices are from the fiber over 0). Let . Then, z is of the form , where (using the fact that and have a common neighbour and and have a common neighbour ). We already considered such vertices when we considered vertices at a distance of two in the graph .Let v be a vertex from the fiber over and z a vertex from the fiber over 1 (similarly, v is from the fiber over and z is from the fiber over 0).Let . Then, z is of the form , where . Let X have the labeling :andIn this case, it is enough to show, via Corollary 1, thatIn the proof of (1), we showed that for some . Therefore,Since and the claim is true according to Corollary 2.Now, observe labeling . We will consider this as similar to the above. We claim thatIn the proof of (2), we see that for some . Therefore,Since , the desired result follows. Accordingly, two vertices that are at a distance of two from each other receive different labels.
We showed that . Further, as is a regular graph of degree 4, the application of Lemma 1 to the preceding statement shows that , if . □
Example 1.
The aforementioned scheme is illustrated in Figure 1, where an -labeling of occurs following that of for .
Figure 1.
Four -labelings of that determined -labelings of direct graph bundle according to the cyclic ℓ-shift : (a) , (b) , (c) , (d) .
4. Cartesian Graph Bundle
Theorem 2.
Let , and . Let be a Cartesian graph bundle with fibre and base and let n be a multiple of s. Then, , with equality if , if one of the following statements holds:
- (a)
- ℓ has the form , where and
- (b)
- for some and ℓ has the form
- (c)
- for some and ℓ has the form
- (d)
- for some , for some and some and ℓ has the form
Proof.
We will present four labelings of using labels according to the cyclic ℓ-shift . Let .
- (i)
- Assume that statement (a) from the theorem holds. For define labeling of v as
- (ii)
- Assume that one of statements (b), (c) or (d) holds. For , define labeling of v as
All assignments are clearly well-defined.
- Since can be represented as the graph obtained from the product by adding edges between vertex sets and , first observe the product .Let X have labeling . Then, v can be assigned the integerLet w be a vertex adjacent to v in . Then, v and w differ in exactly one coordinate. More precisely, w has the form , with one of the following properties:
- (a)
- if , then or ;
- (b)
- if , then or ;
- (c)
- if , then or .
It is clear thatCorollary 1 can show that ; therefore, it is sufficient to show thatand, using symmetry, if X has labeling ,Both claims are true since .Next, let z be a vertex at a distance of two from v in . Then, z is of the form , where v and z differ in exactly one (i) or both coordinates (ii). In all cases, there are three options for the values of and . In (i):- (a)
- if , then or and ;
- (b)
- if , then or and ;
- (c)
- otherwise, or .
In (ii):- (a)
- if , then ;
- (b)
- if , then ;
- (c)
- otherwise, .
Let X have labeling . Then,Since we want to prove that , it is sufficient to prove, using Corollary 1, thatand if X has the labeling , thatThe reader can verify that in (i) we can obtain and in (ii) . Hence, both results follow. - In the following, we are interested in edges in between the fiber over vertex and the fiber over vertex 0. These are edges or in another form .
- Let us first observe two adjacent vertices v and w. Let X have the labeling and let . Then, w is of the form , where for some . Vertex v can be assigned the integerand w can be assigned the integerWe claim that or, through Corollary 1, thatSince there exists such that , it follows that(since equals s for and for ). Using Corollary 2, this can be shown to be equal to d or to and the claim is true.Further, observe labeling . Then, one of the statements—(b), (c) or (d)—of the Theorem applies. Let these be Cases (b), (c) and (d), accordingly. Sinceandin all three cases we have to show thatusing Corollary 1.Case (b) Let (then ). Since for some , we can obtainUsing Corollary 2, this is shown to be equal to .Case (c) Let (then ). Since for some , it holds thatAs in case (a), this is equal to or .Case (d) Let (then ). Since for some , it holds thatFor , we can obtainand for , we can obtainThe desired result follows, since, in this case, we can also obtain or .
- Finally, observe vertices at a distance of two, where the shortest path between them contains some edge between the fiber over and the fiber over 0. Let v and z be two such vertices. Then, v and z are from adjacent fibers (from fiber over and over 0) or from non-adjacent fibers (from fiber over and over 0 or from fiber over and over 1). Let us first observe the case where v and z are from non-adjacent fibers.
- (a)
- Let . Then, z is of the form , where for some (similarly, and ). Let X have the labeling . Vertex v be assigned the integerand vertex z be assigned the integerWe claim that or, using Corollary 1, thatIn the proof of (3), we showed that for some . Therefore,Using Corollary 2, this is equal to or to , and the desired results follow.Let X have labeling . We need to show thatWhen we proved (4), in all three cases, we found that for some . Therefore, we can obtainSince the desired result follows.
- (b)
- Let v and z be from adjacent fibers, and let . Let X have the labeling . Then, z is of the form , where and for some . In this case,andAgain, it is sufficient to show thatRecall that for some (see the proof of (3)). Therefore,The reader can verify that and , so the desired result follows.Let X have the labeling . We need to show thatRecall that for some (see the proof of (4)). Therefore,Since , the desired result follows.Accordingly, two vertices in at a distance of two from each other receive different labels.
We showed that . Further, as is a regular graph of degree 4, the application of Lemma 1 to the preceding statement shows that , if .
□
Example 2.
The presented scheme is illustrated in Figure 2, where an -labeling of appears similar to that of for .
Figure 2.
Four -labelings of that determined -labelings of Cartesian graph bundle according to the cyclic ℓ-shift : (a) , (b) , (c) , (d) .
5. Conclusions
The frequency assignment problem for wireless networks is that networks need to assign a channel to each radio transmitter so that close transmitters receive these channels to avoid interference. This situation can be modeled by a graph whose vertices are the radio transmitters, where the adjacency indicates possible interference. Motivated by this problem, I studied the -number of the direct and Cartesian graph bundles cycles over cycles. I demonstrated that the upper bound of -labeling of these graph bundles is if certain conditions are imposed on the lengths of the cycles and on the cyclic ℓ-shifts . Is optimality achievable? I showed that the -number of these graphs is if the condition is also satisfied.
Funding
This work was funded by Slovenian Research Agency (Programme Group Grant Number: P2-0118).
Data Availability Statement
All relevant data are contained within the manuscript.
Acknowledgments
The authors wish to sincerely thank three anonymous reviewers for their careful reading of the first version of the paper and for providing constructive remarks that helped us to considerably improve the paper.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Hale, W.H. Frequency assignment: Theory and applications. Proc. IEEE 1980, 68, 1497–1514. [Google Scholar] [CrossRef]
- Roberts, F.S. T-colorings of graphs: Recent results and open problems. Discret. Math. 1991, 93, 229–245. [Google Scholar] [CrossRef]
- Griggs, J.R.; Yeh, R.K. Labeling graphs with a conditions at distance 2. SIAM J. Discret. Math. 1992, 5, 586–595. [Google Scholar] [CrossRef]
- Georges, J.P.; Mauro, D.W.; Whittlesey, M.A. Relating path coverings to vertex labeling with a condition at distance two. Discret. Math. 1994, 135, 103–111. [Google Scholar] [CrossRef]
- Chang, G.J.; Kuo, D. The L(2,1)-labeling on graphs. SIAM J. Discret. Math. 1996, 9, 309–316. [Google Scholar] [CrossRef]
- Král’, D.; Skrekovski, R. A theorem about channel assignment problem. SIAM J. Discret. Math. 2003, 16, 426–437. [Google Scholar] [CrossRef]
- Gonçalves, D. On the L(p,1)-labeling of graphs. In Proceedings of the 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’05), Berlin, Germany, 5–9 September 2005; pp. 81–86. [Google Scholar]
- Pisanski, T.; Shawe-Taylor, J.; Vrabec, J. Edge-colorability of graph bundles. Eur. J. Combin. 1988, 9, 215–224. [Google Scholar] [CrossRef]
- Pisanski, T.; Vrabec, J. Graph bundles. Prep. Ser. Deph. Math. 20 1982, 79, 213–298. [Google Scholar]
- Barnes, H.G.; Brown, R.M.; Kato, M.; Kuck, D.J.; Slotnick, D.L.; Stokes, R.A. The ILLIAC IV Computer. IEEE Trans. Comput. 1968, C-17, 746–757. [Google Scholar] [CrossRef]
- Chiang, S.H.; Yan, J.H. On L(d, 1)-labeling of Cartesian product of a cycle and a path. Discret. Appl. Math. 2008, 156, 2867–2881. [Google Scholar] [CrossRef]
- Jha, P.K.; Klavžar, S.; Vesel, A. Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discret. Appl. Math. 2005, 152, 257–265. [Google Scholar] [CrossRef]
- Jha, P.K.; Klavžar, S.; Vesel, A. L(2,1)-labeling of direct product of path and cycles. Discret. Appl. Math. 2005, 145, 317–325. [Google Scholar] [CrossRef]
- Klavžar, S.; Špacapan, S. The Δ2 conjecture for L(2,1)-labelings is true for direct and strong products of graphs. IEEE Trans. Circuits Syst.-II 2006, 53, 274–277. [Google Scholar] [CrossRef]
- Klavžar, S.; Vesel, A. Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2,1)-colorings and independence numbers. Discret. Appl. Math. 2003, 129, 449–460. [Google Scholar] [CrossRef]
- Schwarz, C.; Troxell, D.S. L(2,1)-labelings of Cartesian products of two cycles. Discret. Appl. Math. 2006, 154, 1522–1540. [Google Scholar] [CrossRef][Green Version]
- Whittlesey, M.A.; Georges, J.P.; Mauro, D.W. On the λ-number of Qn and related graphs. SIAM J. Discret. Math. 1995, 8, 499–506. [Google Scholar] [CrossRef]
- Shao, Z.; Klavzar, S.; Shiu, W.C.; Zhang, D. Improved bounds on the L(2,1)-Number of Direct and Strong Products of Graphs. IEEE Trans. Circuits Syst. 2008, 55-II, 685–689. [Google Scholar] [CrossRef]
- Klavžar, S.; Mohar, B. Coloring graph bundles. J. Graph Theory 1995, 19, 145–155. [Google Scholar] [CrossRef]
- Hammack, R.; Imrich, W.; Klavžar, S. Handbook of Product Graphs, 2nd ed.; Discrete Mathematics and Its Applications (Boca Raton); CRC Press: Boca Raton, FL, USA, 2011; p. xviii+518. [Google Scholar]
- Georges, J.P.; Mauro, D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 1995, 109, 141–159. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).