Abstract
There are three different approaches for constructing nanotori in the literature: one with three parameters suggested by Altshuler, another with four parameters used mostly in chemistry and physics after the discovery of fullerene molecules, and one with three parameters used in interconnecting networks of computer science known under the name generalized honeycomb tori. Altshuler showed that his method gives all non-isomorphic nanotori, but this was not known for the other two constructions. Here, we show that these three approaches are equivalent and give explicit formulas that convert parameters of one construction into the parameters of the other two constructions. As a consequence, we obtain that the other two approaches also construct all nanotori. The four parameters construction is mainly used in chemistry and physics to describe carbon nanotori molecules. Some properties of the nanotori can be predicted from these four parameters. We characterize when two different quadruples define isomorphic nanotori. Even more, we give an explicit form of all isomorphic nanotori (defined with four parameters). As a consequence, infinitely many 4-tuples correspond to each nanotorus; this is due to redundancy of having an “extra” parameter, which is not a case with the other two constructions. This result significantly narrows the realm of search of the molecule with desired properties. The equivalence of these three constructions can be used for evaluating different graph measures as topological indices, etc.
1. Introduction
The interest in nanotori started soon after the experimental discovery of the carbon nanotubes []. A nanotube is a molecule with tubical shape comprised only by carbon atoms. The atoms in nanotubes are arranged in form of hexagons, and each atom is bonded with exactly three other carbon atoms. The discovery of nanotubes lead the researchers to believe that carbon nanotorus molecules might exist as well [], i.e., carbon molecules obtained by gluing the two ends of the nanotube. Soon afterwards, an experimental evidence of such molecules appeared [,]. Further research showed that these carbon nanotorus molecules have wide spectrum of properties. Certain species of carbon nanotori exhibit unusual magnetic properties, including persistent magnetic moments at nearly zero flux and colossal paramagnetic moments, and diverse variety of electric properties: some nanotori are conductors, while others are semiconducting or insulators [,,,,]. The properties of carbon nanotori are strongly related to their geometrical parameters, temperature, and the parameters of the nanotube used for their production [].
In chemistry, it is a common practice to represent molecules as graphs; each atom is a vertex and the bonds in the molecule are presented as edges in the graph. Nanotubical graphs, or just nanotubes, are graph representations of nanotubical molecules. Therefore, nanotubes are 3-connected, infinite, cubic planar graphs, and represented in a space they have tubical shape. A nanotube is obtained from a planar hexagonal grid by identifying objects (vertices, edges, faces) lying on two parallel lines, i.e., a hexagonal grid is wrapped into a tube. The wrapping of the hexagonal grid into a tube is determined by a pair of integers such that and . For more details, see [,,].
Nanotorus is a simple 3-regular graph embedded on a torus with hexagonal faces only. The structure of nanotori is described [,,] by ordered pairs of integers and such that , , and for all . It can be considered so that the first pair defines the wrapping of the hexagonal grid into a tube, while the second pair defines the transformation of the (infinite) nanotube into a torus. There is a certain correspondence between these two vectors and some physical properties of the nanotorus. More precisely, these two vectors characterize the carbon nanotorus as a conductor, semiconductor, or insulator []. Several papers considered the symmetry group of nanotubes [] and nanotori [,,] since the symmetry group brings the information about important properties of the band structure (electronic, phonon, etc.).
Similarly, graphs are used to represent network topology. Here, multiprocessors are presented as graphs with vertices representing processors and edges representing links between them. The network topology is crucial for interconnection network since it determines the performance of the network. Meshes and tori are among the most frequent multiprocessor networks available on the market []. Nanotori are good alternative to torus interconnection networks in parallel and distributed applications [,,,]. Stojmenović [] introduced three different nanotori by adding edges on honeycomb meshes (honeycomb rectangular torus, honeycomb rhombic torus, and honeycomb hexagonal torus). This concept was generalized later in [], where a nanotorus was defined with three parameters. Generally, this definition is acquired in computer science, unlike the four parameters definition used in physics and chemistry.
These two approaches of constructing nanotori are inspired by real problems, while the oldest one has purely mathematical motivation. The oldest method for constructing nanotori was suggested by Altshuler [,] back in 1972/73. He considered maps on a torus, i.e., a cellular decomposition of a torus induced by a graph. A map is called regular map of type if each cell/face is of size and each vertex has degree . It is obvious that the dual of a regular map of type is a regular map of type . The Handshake lemma and Euler’s equation for torus imply that the regular map on torus must be of type , or . The regular maps of type are nowadays known as nanotori, and they are in the focus of this article. In [,], there is a construction of all non-isomorphic nanotori on a given number of vertices, using three parameters, , . For each nanotorus, these three parameters are not uniquely determined, i.e., there are at most six different triplets of integers constructing each nanotorus. The Altshuler construction was studied later in [,], in a slightly different notion. In [], the authors classify all regular maps on torus of type or . They give an explicit formula for the number of combinatorial types of these regular maps with n vertices. These formulas are obtained in terms of arithmetic functions in elementary number theory. Similar study of this problem is given in [] as well.
The Altshuler construction differs from the four parameters construction (two parameters for each vector) given in more recent papers [,]. In [,], Altshuler showed that each nanotorus can be described by three parameters. This was not established for the other two constructions so far. In this paper, we show that these three approaches (the one with four parameters used in physics and chemistry, the three parameters construction used in computer science, known as the generalized honeycomb tori, and the three parameters construction by Altshuler) are equivalent, and as a consequence we obtain that that the first two approaches also construct all non-ispomorphic nanotori. Hence, each nanotorus can be determined by a quadruple or a triple (as generalized honeycomb torus or with respect to Altshuler) of integers. Even more, there are finitely many triples (as generalized honeycomb torus or with respect to Altshuler), but infinitely many quadruples of integers that describe the same nanotorus. In this article, we present explicit formulas that transform parameters of one construction into parameters of the other two constructions of nanotori.
2. Three Constructions of Nanotori
A nanotorus is a map on a torus in which every vertex has degree 3 and all faces are hexagons. Here we present the three constructions of nanotori. We start with the four parameters construction [].
2.1. The Four Parameters Construction,
Take an infinite tiling of a plane by hexagons. Then every vertex is incident with exactly 3 hexagons. We denote by A the center of one of these hexagons. Moreover, denote by and two vectors connecting A with centers and , respectively, of adjacent hexagons, such that the triangle is equilateral and its vertices are enumerated in anti-clockwise order. Then, and form the standard basis of the hexagonal tiling (see Figure 1). Sometimes we will use . That is, , where is an equilateral triangle and its vertices are in anti-clockwise order.
Figure 1.
Standard basis of the hexagonal tiling.
By we denote the vector and by we denote the point . Take a quadruple of integers a, b, c and d, so that and are linearly independent, and denote , , and . Observe that B, C, and D are centers of hexagons and is a parallelogram since . We denote this parallelogram by . Now cut from the plane and glue its opposite sides such that the points A, B, C, and D will be identified into a single point. The resulting surface will be orientable. In this way, we obtain a map on a torus, in which every face is hexagon and every vertex has degree 3. Hence, it is a nanotorus. We denote it by and we call a characteristic parallelogram for . A characteristic parallelogram for is given in Figure 2. Observe that from the point of view of incidence, is a unique map. However, it has infinitely many realizations in the space. It is because we can glue the opposite sides of with a shift (see Section 3). Although these realizations are different in three dimensional space, they correspond to isomorphic maps. Therefore, they have the same graph-theoretic invariants.
Figure 2.
Characteristic parallelogram for .
Observe that has positive number of hexagons (and vertices) if and only if and are linearly independent. More insight into this gives the following lemma, which is also given in [].
Proposition 1.
The nanotorus has hexagons and vertices.
Proof.
Observe that the area of a parallelogram equals the length of one side times the altitude perpendicular to this side. We denote this fact by (a).
Having a hexagonal tiling of a plane, denote by z the area of one hexagon. Then the parallelogram with vertices , , , and has area . By (a) also the parallelogram with vertices , , , and has area . Denote this statement by (b).
Now take the parallelogram where , , , and . By (a), the area of does not change if we shift both B and C by any multiple of vector . Let us shift them by vector . This yields a parallelogram where and . Since by (b) the area of is , the area of the original parallelogram is as well.
Thus, has the area of hexagons and so has exactly hexagons. Since the number of hexagons times 6 equals twice the number of edges which is equal to three times the number of vertices, it follows that has vertices. □
Later in this article, we will show that there are infinitely many different quadruples of integers that define isomorphic nanotori to the nanotorus .
2.2. Altshuler’s Construction,
In [], Altshuler gives a different construction from the construction given in Section 2.1. In fact, he gives the construction for duals of nanotori. That is, he constructed toroidal maps in which every face is a triangle and every vertex has degree 6. Similarly, he starts with the infinite hexagonal tiling of a plane and with A being the center of one hexagon. For positive integers and an integer , such that , he denotes , , and . This gives a parallelogram . Now cut this parallelogram from the plane and glue the sides and so that A is identified with and is identified with analogously as in the standard construction. The next gluing is made with a shift by . That is, is glued with (the original edges of the parallelogram become circles after the first gluing), in the manner that A is identified with the point (therefore the requirement ). This procedure gives a nanotorus which we denote by . The construction of an nanotorus is given in Figure 3. The next proposition (cf. []) follows trivially from the construction.
Figure 3.
Construction of a nanotorus . Points A, , and coincide. Blue segments form a hexagon on .
Proposition 2.
The number of vertices and hexagons in the nanotorus are and , respectively.
In [], Altshuler shows that every nanotorus is isomorphic to for some triple of values r, n, and , where , and he gives bounds for the number of nonisomorphic nanotori having v hexagons. For this he uses the notion of normal cycle. Let be a sequence of hexagons in a nanotorus such that and share an edge for every (indexed modulo n). Now, we say that the sequence forms a normal cycle (of length n), if and are antipodal edges on a hexagon, the for every (indexed modulo n). It is not obvious that a nanotorus has a normal cycle. Nevertheless, in an earlier work [], Altshuler proved that there are three normal cycles passing thought every hexagon in a nanotorus. Cutting the nanotorus along a normal cycle gives the tube obtained after gluing with as described above (observe that because of normal cycle one must glue with without twist, since the normal cycle passes through both A and ). Examples of normal cycles are given in Figure 4. The number of normal cycles determines the upper bound of the number of isomorphic nanotori with different parameters. As there are three normal cycles passing through every hexagon, the following holds.
Figure 4.
(a) Normal cycle in , . (b) Normal cycles in , . The characteristic parallelogram for is obtained by rotation of the characteristic parallelogram for 60.
Observation 1.
Every nanotorus can be represented by at most six different triplets of integers by Altshuler’s construction .
2.3. Generalized Honeycomb Torus Construction,
In some papers, just to mention few [,,], nanotori are constructed in a different way using three parameters , and c. Therein, nanotori are called (generalized) honeycomb tori, and are denoted by .
We adopt the following notation. For and , we denote by the integer satisfying and . Let us assume that a and b are positive integers, and b is even. Let c be any integer such that and is an even number. The generalized honeycomb torus is a structure with vertex set such that and are adjacent if they satisfy one of the following conditions:
- (i)
- and ;
- (ii)
- , , is even, and ;
- (iii)
- , and and j is even.
The construction of generalized honeycomb torus is given in Figure 5. The vertices with the same labels are overlapping.
Figure 5.
Generalized honeycomb torus .
Similarly as for the previous two constructions, the number of vertices and hexagons in a generalized honeycomb torus can be determined in the following way.
Proposition 3.
The generalized honeycomb torus, , has exactly vertices and hexagons.
Similarly to Altshuler’s construction, there are finitely many generalized honeycomb tori isomorphic to each other. More precisely, by Observation 1 and by the results stated later (Propositions 4 and 5), there are at most six different triples of integers that define the same generalized honeycomb torus.
Note that the presented construction for some borderline values may not provide a cubic graph. For example, :
- –
- for , b even, and ; or
- –
- for , and .
The same holds for the other two constructions. In what follows we will ignore such borderline cases.
3. Relation between the Constructions
Although we introduced three different constructions of nanotori, they all produce isomorphic structures. In what follows we prove this statement.
3.1. Relation between and
First we consider the isomorphism between generalized honeycomb tori and nanotori defined according to Altshuler.
Proposition 4.
The generalized honeycomb torus , where , b and are even, is isomorphic to .
Proof.
Let us consider a generalized honeycomb torus . Observe that from the conditions of the adjacency in , one obtains numbering of the points of the infinite tiling. The vertices in the infinite hexagonal tiling are denoted by , and the vertices and are adjacent if the following conditions hold:
- (i*)
- and ; and
- (ii*)
- , and and is even.
Having the vectors and in the regular hexagonal tiling, as described in Section 2.1, we get that and (see Figure 5). The condition identifies the vertices and in where b is even. Hence, the vertex is identified with the vertex . This condition defines a nanotube. For j even, from the condition we have that the vertex , , is identified with the vertex . The vertex in can be expressed as
This identification implies that the nanotorus is . □
Directly from Proposition 4, we have the following.
Proposition 5.
The nanotorus , where , is isomorphic to the generalized honeycomb torus .
From Proposition 4 (and also Proposition 5), it is clear that these two definitions with three parameters are equivalent. As shown in Figure 3 and Figure 5, the parallelograms are identical. Indeed, Proposition 4 implies that . The vertices , , and on Figure 5 are the vertices used in the construction in Section 2.2.
3.2. Relation between Constructions M and
Next, we show that each nanotorus is isomorphic to nanotorus for some .
Proposition 6.
The map is isomorphic to , where .
Proof.
Consider determined by the parallelogram with vertices , , and in which A is identified with . Now cut the triangle from the parallelogram and attach it by side to . This gives a parallelogram , which should be glued so that all its vertices are identified into a single point. Hence, this identification gives the map .
If , we are done as . Otherwise, denote by the vertex of opposite to A so that is . Now cut the triangle from and attach it by side to . This gives a parallelogram and identifying its opposite sides we obtain . Repeating this procedure several times, we obtain the result. □
Observe that the nanotori , , , and are all isomorphic. This observation and Proposition 6 implies the next result.
Proposition 7.
The map is isomorphic to , where .
3.3. Relation between and M
Next, we determine the relation between the generalized honeycomb torus and the nanotorus M, determined with four parameters. Similarly, like in the previous cases, from Propositions 4 and 6, we obtain the following propositions.
Proposition 8.
is isomorphic to , where .
In the same manner, we find that the following holds.
Proposition 9.
The nanotorus is isomorphic to the generalized honeycomb torus where .
It remains to find maps isomorphic to . By Propositions 6 and 9, it suffices to find a map isomorphic to , where . At the end of this article (Theorems 2 and 3), we show that for each nanotorus there are infinitely many isomorphic nanotori . Among them, there are nanotori (Corollary 2), moreover, the representation of the form is not unique (Corollary 3), and much more than that there are infinitely many such representations.
Now, Corollary 3 combined with Propositions 6 and 9, imply the following results, respectively. (See Corollaries 4 and 5).
Proposition 10.
The nanotorus is isomorphic to where for are determined in Corollary 3.
Proposition 11.
The nanotorus is isomorphic to the generalized honeycomb torus where and for are determined in Corollary 3.
In order to prove Propositions 10 and 11, we describe a technique of finding whether two nanotori and are isomorphic (Section 4).
4. Isomorphisms of Nanotori through Construction M
Isomorphism of maps and was described already in []. In [], the authors study the number of nonisomorphic nanotori with a given number of vertices. In a later paper [], authors studied the isomorphism between regular and chiral nanotori. Here, we present a different approach and we consider isomorphism of maps and . As a consequence, we show that there are infinitely many quadruples of integers that construct the nanotori isomorphic to .
Let be a nanotorus. As explained above, it is constructed from the infinite tiling of a plane by hexagons by cutting out the characteristic parallelogram with vertices , , , and , and gluing properly opposite sides of . There is an alternative description of the construction of . Take again the infinite tiling of a plane by hexagons with the standard basis and as described above (see Figure 1). For every point , , identify T with all points , where . Obviously, the resulting map is . Observe that this construction immediately implies that for every pair of hexagons A and B in , there is an automorphism of mapping A to B. In other words, the dual of is vertex-transitive.
Now take the infinite tiling of a plane by hexagons and consider the set of points
Then is precisely the set of points which are identified with in the construction of . We call it the mesh of points of (see Figure 6).
Figure 6.
A mesh of points of , i.e., .
Let us choose a different pair of linearly independent vectors and . If , then and are obtained by identifying the same sets of points, so they are isomorphic. Obviously, and are isomorphic also if there exists an automorphism of which maps the set of points to . It is interesting that the opposite implication is also true. We have the following.
Proposition 12.
Let and be two pairs of linearly independent vectors. Then and are isomorphic if and only if there is an automorphism of fixing and mapping to .
We remark that Proposition 12 is a direct consequence of the fact that a plane regularly covers a torus. Nevertheless, our proof is elementary and shows the importance of normal cycles, see also the examples below the proof.
Proof.
Since the sufficiency is trivial, it suffices to prove that if and are isomorphic nanotori, then there is an automorphism of fixing and mapping to . To simplify the notation, denote by M and the maps and , respectively. In addition, denote by S and the sets and , respectively. Moreover, if is a point of which is a center of a hexagon, we denote by and the corresponding hexagons in M and , respectively.
As already mentioned, three normal cycles are passing through every hexagon in M. Consider the normal cycle created by hexagons and denote its length by n. Then, forms another normal cycle. Since every hexagon has exactly six neighbors in M, these two cycles are either identical or disjoint. Since M is a finite map, proceeding in this way we construct several disjoint cycles of hexagons, say r, while the -st cycle is identical with the first one. Consequently, is identified with for some m. We choose to be the smallest integer such that the previous statement is satisfied.
By the definition of normal cycle, we have and no internal point of the line segment starting at and terminating at is in S. Hence, S contains only the points on the line . In addition, if . But and also for . Extending this argumentation to the whole plane we get
and M is isomorphic to . Figure 7 shows the nanotori and . Observe that these nanotori are isomorphic.
Figure 7.
Characteristic parallelogram (gray) for and characteristic parallelogram (green) for . The nanotori they define are isomorphic.
Now let be an isomorphism mapping M to . Since the duals of nanotori are vertex transitive, we may assume that . Let and be points of such that and . Then for the vectors and both connect centers of neighboring hexagons in ; hence, they have the same length as and , and is an equilateral triangle. Thus, there is an automorphism of fixing and mapping to and to .
Since is an isomorphism, the chain of hexagons is a normal cycle in . For the very same reasons, the cycles are different from if , while is identical with . Consequently, is isomorphic to for some . (Observe that for this isomorphism one has to apply .) However, is a cycle of hexagons in M which “turns left” by one hexagon at and “turns right" by one hexagon at . Hence, must be a cycle of hexagons in turning by one hexagon at and oppositely turning by one hexagon at since is an isomorphism mapping M to . Thus, and
Since
and is an automorphism of mapping to and to , we get the result. □
In the next two paragraphs we consider few examples. Characteristic parallelogram for is given in Figure 4a. Start at and construct a normal cycle in direction of . This normal cycle contains all hexagons of the nanotorus, hence ; n equals the number of hexagons, i.e., . The center is identified with , i.e., with , (see Figure 7). Thus, is isomorphic to , . Choosing , one obtains and . Recall that three normal cycles are passing through every hexagon, one in each direction , and . Analogously, in the direction of and , we find isomorphic nanotori and , , respectively.
In Figure 4b, there is a characteristic parallelogram for . Start at and construct a normal cycle in direction of . This normal cycle does not contain all hexagons of the nanotorus, there is also another normal cycle “parallel” to it. Hence, and . Figure 8 shows that . Thus, is isomorphic to , . Plugging , one obtains . Transitivity implies that and are isomorphic nanotori.
Figure 8.
Characteristic parallelogram (gray) for and characteristic parallelogram (green) for . These parallelograms define isomorphic nanotori.
In the sequel, we describe all automorphisms of fixing and then we find all pairs of linearly independent vectors and such that for the meshes of points .
The group of automorphisms of fixing is the dihedral group . It consists of 6 rotations and 6 reflections. Let be an anti-clockwise rotation by angle around . Observe that maps to and to . Let be a reflexion with axis , where . The elements of the group of automorphisms of fixing are , where is the identity. Let be an arbitrary point of . We have
Now we find all vectors and such that . We have the following statement.
Lemma 1.
Let and be two pairs of linearly independent vectors. Then, if and only if there are such that , and .
Proof.
Denote and . First we show the necessity of the conditions. Hence, suppose that . Since , all points of must be of the form for some . Hence, also and , the vectors determining the sides of the characteristic parallelogram for , must be of this form. So there are such that and there are such that .
By Proposition 1, has exactly hexagons while has
of them. Thus, .
On the other hand, suppose that there are such that , and . Obviously since every point of has the form
for some , where and . It suffices to show that . However, we have
If we denote the matrix by , then (1) states that . Since , we get
Since , for , , , and we get and , which implies that . □
Combining Proposition 12 and Lemma 1, we get the following statement.
Theorem 2.
Let and be two linearly independent pairs of vectors. Then the nanotori and are isomorphic if and only if there are , and an automorphism of fixing and mapping to and to such that , and .
Or equivalently, by taking (*) into account, we have
Theorem 3.
Let and be two pairs of linearly independent vectors. Then the nanotori and are isomorphic if and only if there are such that and at least one of the following holds
- 1:
- and ;
- 2:
- and ;
- 3:
- and ;
- 4:
- and ;
- 5:
- and ;
- 6:
- and .
Theorem 3 (2) and (3) imply that , , and are isomorphic nanotori, see Figure 9. Observe that the equation has infinitely many solutions in . This fact together with Theorems 2 and 3 imply the following.
Figure 9.
The gray parallelogram, is defining nanotori. The green parallelogram , in (a) is obtained by reflection and in (b) by rotation. (a) ; (b) .
Corollary 1.
Each torus is isomorphic to infinitely many tori .
Redundancy of the Parameters of
Hence, the last corollary motivates us to look for quadruples having 0 as one of the four parameters. Indeed, we find n, r, and m, such that is isomorphic to . In what follows, we treat general nanotorus and naturally we assume that and are linearly independent vectors.
Corollary 2.
Let x and y be integer solutions of the equation . Then, is isomorphic to , where , and .
Proof.
Observe that b and d cannot be both equal to 0 since and are linearly independent. Without loss of generality we assume that . Choose and .
Then
Let and be integer solutions of equation . Then, for we get
Since , we get
Thus, is isomorphic to , by Theorem 3 (1). Since is isomorphic to for arbitrary by Theorem 3 (1), we get the result. □
By Theorem 3 (2), is isomorphic to , and by Theorem 3 (3), is isomorphic to also to . The parallelograms for and are obtained from the parallelogram for by and , respectively. Recall that three normal cycles are passing through every hexagon of . One normal cycle in is , i.e., moving in the direction of . The other two are moving in directions of and , respectively. The alternative way to obtain the other two normal cycles in is to move in direction of in and , respectively. Thus, we can generalize Corollary 2 to the following result.
Corollary 3.
Let , , and . Denote for , and
- , where are integer solutions of ;
- , where are integer solutions of ;
- , where are integer solutions of .
Then is isomorphic to for every i, .
As mentioned above, through every hexagon of three normal cycles are passing and, by Corollary 3, their lengths are , , and . Hence, this corollary gives us the possibility to represent with one side of the characteristic parallelogram being the vector , where n is the length of the longest normal cycle in the nanotorus, and there are infinitely many such representations In addition, the vector , the second side of the parallelogram, can be chosen such that .
Applying Corollary 3 to , we find that it is isomorphic to , , , , , , and infinitely many others. In this case and . If Corollary 3 is applied to , , , and respectively . Hence, the nanotori , , , , and infinitely many others are isomorphic to .
Proposition 6 and Corollary 3 imply the following.
Corollary 4.
The nanotorus is isomorphic to where for are determined in Corollary 3.
Similarly, Proposition 9 and Corollary 3 imply the relation between the nanotorus and generalized honeycomb tori .
Corollary 5.
The nanotorus is isomorphic to the generalized honeycomb torus where and for are determined in Corollary 3.
Applying Corollary 4 to , we find that this nanotorus is isomorphic to , , , , , and . Analogously, by Corollary 5, one can find six different triplets , such that is isomorphic to . They are , , , , , and . It is worth mentioning that there are cases, such as , that have only one representation with respect to Altshuler, , or as generalized honeycomb torus, . From these remarks it is obvious that a given nanotorus might have one or more (at most six) different Altshuler (resp. generalized honeycomb torus) representations. For more details, refer to the counting of the representations we refer to [,].
5. Concluding Remarks
We studied three, known in the literature, approaches for constructing nanotori. The first one was suggested by Altshuler. Later, inspired by by real life problems, two new and different approaches were introduced; one for describing nanotori molecules, and another one for describing interconnecting networks in computer science. In his work Altshuler showed that his method gives all non-isomorphic nanotori, but for the last two definitions there were no such results. Here we showed that the later two approaches also construct all nanotori. At the same time, we gave explicit formulas that convert parameters of one construction into the parameters of the other two constructions. The equivalence of these three constructions can be used for evaluating different graph measures as topological indices.
The four parameters construction is mainly used in chemistry and physics to describe carbon nanotori molecules. We show that there are infinitely many quadruples that determine the same nanotorus, and we characterize when two different quadruples define isomorphic nanotori. Even more, we gave an explicit form of all isomorphic nanotori (defined with four parameters). This result significantly narrows the realm of search of the molecule with desired properties.
Author Contributions
Conceptualization, R.Š., P.D. and M.K.; supervision, R.Š.; visualization, V.A.; writing—original draft, P.D. and M.K.; writing—review & editing, V.A. and R.Š. All authors have read and agreed to the published version of the manuscript.
Funding
The authors acknowledge partial support by Slovak research grants VEGA 1/0142/17, VEGA 1/0238/19, APVV–15–0220, APVV–17–0428, Slovenian research agency ARRS, program no. P1–0383, National Scholarship Programme of the Slovak Republic, and by the bilateral project “Microlocal analysis and applications” between the Macedonian and Serbian academies of sciences and arts.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Iijima, S. Helical microtubules of graphitic carbon. Nature 1991, 354, 56–58. [Google Scholar] [CrossRef]
- Dunlap, B.I. Connecting carbon tubules. Phys. Rev. B 1992, 46, 1933–1936. [Google Scholar] [CrossRef] [PubMed]
- Liu, J.; Dai, H.; Hafner, J.H.; Colbert, D.T.; Smalley, R.E.; Tans, S.J.; Dekker, C. Fullerene “Crop circles”. Nature 1997, 385, 780–781. [Google Scholar] [CrossRef]
- Martel, R.; Shea, H.R.; Avouris, P. Ring formation in single-wall carbon nanotubes. J. Phys. Chem. B 1999, 103, 7551–7556. [Google Scholar] [CrossRef]
- Haddon, R. Electronic properties of carbon toroids. Nature 1997, 388, 31–32. [Google Scholar] [CrossRef]
- Lin, M.F.; Chuu, D.S. Persistent currents in toroidal carbon nanotubes. Phys. Rev. B 1998, 57, 6731–6737. [Google Scholar] [CrossRef]
- Liu, L.; Guo, G.Y.; Jayanthi, C.S.; Wu, S.Y. Colossal Paramagnetic Moments in Metallic Carbon Nanotori. Phys. Rev. Lett. 2001, 88, 217206–217210. [Google Scholar] [CrossRef]
- Sarapat, P.; Hill, J.M.; Baowan, D. A Review of Geometry, Construction and Modelling for Carbon Nanotori. Appl. Sci. 2019, 9, 2301. [Google Scholar] [CrossRef]
- Tsai, C.C.; Shyu, L.F.; Chiu, C.W.; Chang, C.P.; Chen, B.R.; Lin, M.F. Magnetization of armchair carbon tori. Phys. Rev. B 2004, 70, 075411. [Google Scholar] [CrossRef]
- Liu, L.; Liu, F.; Zhao, J. Curved carbon nanotubes: From unique geometries to novel properties and peculiar applications. Nano Res. 2014, 7, 626–657. [Google Scholar] [CrossRef]
- Andova, V.; Knor, M.; Škrekovski, R. Distances on nanotubical graphs. J. Math. Chem. 2016, 54, 1575–1584. [Google Scholar] [CrossRef]
- Andova, V.; Knor, M.; Škrekovski, R. Distances based indices on nanotubical graphs: Part 1. J. Math. Chem. 2018, 56, 2801–2815. [Google Scholar] [CrossRef]
- Andova, V.; Knor, M.; Škrekovski, R. Distances based indices on nanotubical graphs: Part 2. J. Math. Chem. 2018, 56, 3076–3088. [Google Scholar] [CrossRef]
- Arezoomand, M.; Taeri, B. The full symmetry and irreducible representations of nanotori. Acta Crystallogr. A 2009, 65, 249–252. [Google Scholar] [CrossRef]
- Dienes, K.R.; Thomas, B. Isospectral But Physically Distinct: Modular Symmetries and their Implications for Carbon Nanotori. Phys. Rev. B 2011, 84, 085444. [Google Scholar] [CrossRef]
- Zhang, Z.; Yang, Z.; Wand, X.; Yuan, J.H.; Zhang, M.Q. The electronic structure of a deformed chiral carbon nanotorus. J. Phys. Condens. Matter 2005, 17, 249–255. [Google Scholar] [CrossRef]
- Damnjanović, M.; Vuković, T.; Milošević, I.; Nikolić, B. Symmetry of single-wall nanotubes. Acta Cristal. A 2001, 57, 304–310. [Google Scholar] [CrossRef]
- Staic, M.D.; Petresku-Nita, A. Symmetry group of two special types of carbon nanotori. Acta Cristal. A 2013, 69, 435–439. [Google Scholar] [CrossRef]
- Yavari, M.; Ashrafi, A.R. On the Symmetry of a Zig-Zag and an Armchair Polyhex Carbon Nanotorus. Symmetry 2009, 1, 145–152. [Google Scholar] [CrossRef]
- Zurawski, R. Embedded Systems Handbook: Embedded Systems Design and Verification; CRC Press: San Francisco, CA, USA, 2018. [Google Scholar]
- Cho, H.; Hsu, L. Generalized honeycomb torus. Inf. Process. Lett. 2003, 86, 185–190. [Google Scholar] [CrossRef]
- Megson, G.M.; Yang, X.; Liu, X. Honeycomb tori are Hamiltonian. Inf. Process. Lett. 1999, 72, 99–103. [Google Scholar] [CrossRef]
- Stojmenović, I. Honeycomb networks: Topological properties and communication Algorithms. IEEE Trans. Parallel Distrib. Syst. 1997, 8, 1036–1042. [Google Scholar] [CrossRef]
- Shih, Y.-K.; Wu, Y.-C.; Kao, S.-S.; Tana, J.J.M. Vertex-bipancyclicity of the generalized honeycomb tori. Comp. Math. Appl. 2008, 56, 2848–2860. [Google Scholar] [CrossRef]
- Altshuler, A. Hamiltonian circuits in some maps on the torus. Discret. Math. 1972, 1, 299–314. [Google Scholar] [CrossRef][Green Version]
- Altshuler, A. Construction and enumeration of regular maps on the torus. Discret. Math. 1973, 4, 201–217. [Google Scholar] [CrossRef][Green Version]
- Brehma, U.; Kühnel, W. Equivelar maps on the torus. Eur. J. Combin. 2008, 29, 1843–1861. [Google Scholar] [CrossRef][Green Version]
- Hubard, I.; Orbanić, A.; Pellicer, D.; Ivić Weiss, A. Symmetries of Equivelar 4-Toroids. Discret. Comput. Geom. 2012, 48, 1110–1136. [Google Scholar] [CrossRef][Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2020 by the authors. 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 (http://creativecommons.org/licenses/by/4.0/).