Issue |
Wuhan Univ. J. Nat. Sci.
Volume 29, Number 6, December 2024
|
|
---|---|---|
Page(s) | 563 - 571 | |
DOI | https://doi.org/10.1051/wujns/2024296563 | |
Published online | 07 January 2025 |
Mathematics
CLC number: O157.5
Nonisomorphic Orientable Quadrangular Embeddings and Edge-Colorings of K12s+9
K12s+9的不同构可定向四边形嵌入及染色
1 College of Science, Minzu University of China, Beijing 100081, China
2 Department of Basic Courses, Rocket Force University of Engineering, Xi'an 710025, Shaanxi, China
Received:
20
February
2024
In this paper, by constructing the current graph of the complete graph and a mapping function, we prove that
(
is an odd number) has at least
nonisomorphic orientable quadrangular embeddings, and the orientable genus is
. Every one of the nonisomorphic orientable quadrangular embeddings has at least twenty-four 4-edge-colors, and each color appears around each face of orientable quadrangular embeddings.
摘要
本文通过构造完全图的电流图和一个同构映射,证明了
(
是一个奇数)至少有
个不同构可定向四边形嵌入,且可定向亏格为
。每一个不同构可定向四边形嵌入至少有24个4边染色,每种颜色出现在四边形嵌入的每一个面上。
Key words: quadrangular embedding / maximum genus embedding / edge-colorings / complete graph / current graph
关键字 : 四边形嵌入 / 最大亏格嵌入 / 边染色 / 完全图 / 电流图
Cite this article: LI Zhaoxiang, LIU Jiahong. Nonisomorphic Orientable Quadrangular Embeddings and Edge-Colorings of K12s+9[J]. Wuhan Univ J of Nat Sci, 2024, 29(6): 563-571.
Biography: LI Zhaoxiang, male, Professor, research direction: graph theory. E-mail: zhaoxiangli8@163.com
© Wuhan University 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
0 Introduction
In this paper, all graphs are simple and connected. A polyhedron on the surface is called a quadrangulation if each face of the polyhedron is a quadrangle with four distinct vertices. Let be the current group of a current graph. Two digraphs
and
are said to be isomorphic if there are bijections
and
, such that if an arbitrary arc
is directed from a vertex
to a vertex
, then the arc
is directed from the vertex
to the vertex
. Two digraphs
and
are said to be strong isomorphic if there is an isomorphism
of
into
and an automorphism
of
such that
for every arc
of
[1].
Embedding theory of graphs has been widely used in very large scale integrated circuits[2], etc. There are many results on the maximum genus orientable embeddings (orientable surface embeddings with one face), for instance, Xuong[3], Liu[2,4,5] and Škoviera[6] studied this problem. The maximum genus orientable embeddings of current graphs are often used to construct the embedding of complete graphs[7]. There have been many results on triangular embeddings of complete graphs, for example, the results of Ref. [1] and Refs. [8-11].
Korzhik[12] generated nonisomorphic quadrangular embeddings of the complete graph . Hartsfield and Ringel[13] proved that a complete graph
has an orientable quadrangular embedding if
, and these embeddings determine polyhedra with a minimal number of quadrangles. Hartsfield and Ringel[14] proved that a complete graph
has a nonorientable quadrangular embedding if
, and these embeddings determine polyhedra with a minimal number of quadrangles. In recent years, Liu et al[15,16] have obtained some new results on quadrangulations. Korzhik[12] constructed
nonisomorphic oritentable quadrangular embeddings of
.
In this paper, we first construct the current graph of the complete graph , and prove that
has at least
nonisomorphic orientable quadrangular embeddings by finding the maximum genus embedding of the current graph of
. Then, by finding the proper 4-edge-colors of the current graph of
and constructing a mapping function, we prove that every one of the nonisomorphic orientable quadrangular embeddings has at least twenty-four 4-edge-colors, and each color appears around each face of orientable quadrangular embeddings.
1 Construction of the Current Graph
Let be an odd number, and let
be a 4-regular graph with
vertices and
edges, as shown in Fig. 1.
![]() |
Fig. 1
![]() ![]() |
Each arc of has an orientation and a value called its current.
can be decomposed into two Hamiltonian cycles,
and
(shown as Fig. 2 and Fig. 3).
has current
.
has current
.
![]() |
Fig. 2 Hamiltonian cycle ![]() |
![]() |
Fig. 3 Hamiltonian cycle ![]() |
has the following properties:
C1) Each vertex has valence 4.
C2) Each element of
appears exactly once as a current on some
is an cyclic group, the additive group of integers modulo
.
C3) At each vertex, the sum of the inward flowing currents equals the sum of the outward flowing currents. This property is known as Kirchhoff's Current Law (KCL).
2 Maximum Genus Embeddings
A spanning tree in a graph
is called optimal, if the number of odd components, denoted by
, of
is the smallest among all the spanning trees of
.
Theorem 1[3,5] The maximum genus of a graph in orientable surfaces is
, where
is the Betti-number of
and
is the number of odd components in an optimal tree
in
.
Theorem 2[2,3] Let be an optimal tree in a graph
with
odd components in
. Then edges of
may be partitioned as follows:
and
is a matching of
,
,
.
Theorem 3[2] Let be the Betti-number of
. If
, then
can be embedded in an orientable surface with one face.
Theorem 4 The current graph of
(see Fig. 1,
is an odd number) has at least
orientable surface embeddings with one face, and the orientable maximum genus
.
Proof
has
vertices and
edges,
. By Theorem 3,
can be embedded in an orientable surface with one face. As shown in Fig. 4,
has an optimal tree
. By Theorem 2,
may be partitioned as follows:
,
, and
.
![]() |
Fig. 4
![]() ![]() |
has
vertices of valence 4 and
vertices of valence 1. A vertex of valence 4 can have one of the six different rotations. Every rotation scheme determines a planar embedding of
with a single region (face) whose boundary is
. Therefore,
has
orientable surface embeddings with one face.
As shown in Fig. 5, ,
. Consider the vertex
and fix it at a copy of
on
. We choose a copy of
and
on
, respectively. Note that there are
and
ways of doing so, where
. Then, we find a new facial walk
, which contains
and the edges
,
.
We choose the labeling of and
so that, in
, the selected copies of vertices
and
occur in the order of
. Between the two consecutive edges at the current rotation at
goes
. We extend the rotation
at
from
to
. Likewise, we insert the edge
between the consecutive (at that copy of
) edges and the same for
at
. Now we obtain
to have its orientable surface embeddings with one face on the torus, with a single region (face) bounded by edges of
. It is clear that there are at least
ways to construct
.
As shown in Fig. 6,,
. Consider the vertex
and fix it at a copy of
on
. Then choose a copy of
and
on
, respectively. Note that there are
and
ways of doing so, where
. Then we find a new facial walk
, which contains
and the edges
.
We choose the labeling of and
so that, in
, the selected copies of vertices
, and
occur in the order of
. Between the two consecutive edges at the current rotation at
,
goes
. We extend the rotation
at
from
to
. Likewise, we insert the edge
between the consecutive (at that copy of
) edges and the same for
at
, as shown in Fig.7. Now we obtain
to have its orientable surface embeddings with one face on
, with a single region (face) bounded by edges of
. It is clear that there are at least
ways to construct
.
Repeat the above procedure for , we add all
. We can obtain
to have its orientable surface embeddings with one face on
, with a single region (face) bounded by edges of
, as shown in Fig.8.
As shown in Fig. 9, ,
. Consider the vertex
and fix it at a copy of
on
. Then choose a copy of
and
on
, respectively. Note that there are
and
ways of doing so, where
. Then we find a new facial walk
, which contains
and the edges
.
![]() |
Fig. 9 Underlying graph of the current graph of![]() |
We choose the labeling of and
so that, in
, the selected copies of vertices
and
occur in the order of
. Between the two consecutive edges at the current rotation at
goes
. We extend the rotation
at
from
to
. Likewise, we insert the edge
between the consecutive (at that copy of
) edges and the same for
at
. Now we obtain
to have its orientable surface embeddings with one face on
, with a single region (face) bounded by edges of
. It is clear that there are at least
ways to construct
.
From all the steps above, the current graph of
has at least
orientable surface embeddings with one face. The orientable maximum genus
.
3 Quadrangular Embeddings
Rule : If in row
has:
, and in row
has:
; then in row
has:
, and in row
has:
.
Theorem 5 If the rotation scheme of the complete graph satisfies the Rule
, then it is an orientable quadrangular embedding, and the orientable genus is
.
Proof We can demonstrate this using Fig. 10. Given the part of the rotation scheme, this means, in the rotation of the vertex
, the arc joining
and
follows the arc joining
and
(the first part of Fig. 10), and the part
of the rotation scheme, this means, in the rotation of the vertex
, the arc joining
and
follows the arc joining
and
(the second part of Fig. 10). Using Rule
, one gets the part
of the rotation scheme, this means in the rotation of the vertex
, the arc joining
and
follows the arc joining
and
(the third part of Fig. 10), and the part
of the rotation scheme, this means, in the rotation of the vertex
,the arc joining
and
follows the arc joining
and
(the fourth part of Fig. 10). When Rule
is used, the circuit is closed (the fifth part of Fig. 10).
![]() |
Fig. 10 The construction of quadrangle |
Each circuit (face) determined by this rotation scheme is quadrilateral, and the order of each vertex's rotation of the circuit (face) is the same. By Mohar and Thomassen, see P92-93 of Ref.[17], this rotation scheme is an orientable quadrangular embedding.
If is embedded into an orientable surface
, by Euler's formula:
,
is the orientable genus of surface
. Therefore,
,
.
The orientable genus is a natural number, then
or
. Therefore, we have
Corollary 1[15] If there exists a quadrangular rotation of the complete graph , then
or
.
Theorem 6 Let (see Fig. 1,
is an odd number) be the current graph of the complete graph
, for every one of the orientable surface embeddings with one face of
, there exists a quadrangular embedding of
into an orientable surface, and the orientable genus is
.
Proof From Chapter 2 and 4 of Ref. [7], we know that for each (
is a set of rotation systems), the pair
determines an embedding of
(
is the current assignment of
). Here, we first find the set
of rotation systems of
.
We use the current graph to construct quadrangular rotations of
in the following way. Consider the circuit induced by the rotation of the orientable surface embedding with one face of
. Record the currents sequentially as they occur in the circuit, but if the direction of the circuit is opposite to the direction of the considered arc, record it with a minus sign and take this as row 0 of the rotation scheme of
. Applying Additive Rule[7], from the row 0, we can obtain all rows of the rotation scheme for
, in which the row
is the rotation of the vertex
of
.
A vertex of valence 4 can have one of the six different rotations. Assume that in the rotation scheme, one finds . The Additive Rule[7] says that
appears in row 0.
and
are the currents on the arc of
, the two arcs incident to the same vertex of
(Fig. 11(a)). The valence of each vertex of
is 4, therefore, there are six cases. The local picture of the current graph is shown in Fig. 11(a).
![]() |
Fig. 11 The local picture of the current graph of Case 1 |
Here, all the operations are modulo .
,
.
, and
.
Case 1 As shown in Fig. 11(a), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
.
Case 1.1 See Fig. 11(a) and Fig. 11(b), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
, i.e.,
,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
, i.e.,
,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, then
. Because
,
are the currents of
, and
, then
.
According to the Kirchhoff's Current Law (property C3), and consequently
.
is the current of
and
. Hence
and
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
. appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
Therefore, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
Case 1.2 See Fig. 11(a) and Fig. 11(c), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, we have
. Because
and
are the currents of
, and
, we have
.
According to the Kirchhoff's Current Law (property C3), we have and consequently
.
is the current of
, and
. Hence
and
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row k as follows:
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row l as follows:
.
appear in the row 0 of the rotation scheme. By Additive Rule[7], we get row
as follows:
.
Therefore, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
Case 2 As shown in Fig. 12(a), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
.
![]() |
Fig.12 The local picture of the current graph of Case 2 |
Case 2.1 As shown in Fig. 12(a) and Fig. 12(b), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, we have
. Because
and
are the currents of
, and
, we have
.
According to the Kirchhoff's Current Law (property C3), and consequently
.
is the current of
, and
. Hence
and
.
Similar to the Case 1.1, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
Case 2.2 As shown in Fig. 12(a) and Fig. 12(c), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
, i.e.,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, then
. Because
and
are the currents of
, and
, then
.
According to the Kirchhoff's Current Law (property C3), and consequently
.
is the current of
and
. Hence
and
.
Similar to the Case 1.2, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
Case 3 As shown in Fig. 13(a), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
.
![]() |
Fig. 13 The local picture of the current graph of Case 3 |
Case 3.1 As shown in Fig. 13(a) and Fig. 13(b), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
, i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, then
. Because
and
are the currents of
, and
, then
.
According to the Kirchhoff's Current Law (property C3), and consequently
.
is the current of
, and
. Hence
, and
.
Similar to the Case 1.1, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
Case 3.2 As shown in Fig. 13(a) and Fig. 13(c), and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme;
and
are consecutive currents of the circuit which is induced by the rotation of the orientable surface embedding with one face of
,i.e.,
appear in the row 0 of the rotation scheme.
Let (if
, let
). Because
, then
. Because
and
are the currents of
, and
, then
.
According to the Kirchhoff's Current Law (property C3), and consequently
.
is the current of
, and
. Hence
and
.
Similar to the Case 1.2, Rule holds. By Theorem 5, we really have constructed an orientable quadrangular rotation of
.
By Theorem 5, we obtain the orientable genus is .
Theorem 7[1] Suppose that the group of strong automorphisms of a digraph consists of
elements. Suppose that there exist
different one-rotations
of
. Then among these
different current graphs
there are at least
current graphs generating nonisomorphic embeddings of
.
Theorem 8 The complete graph (
is an odd number) has at least
nonisomorphic orientable quadrangular embeddings, and the orientable genus is
.
Proof By Theorem 4, the current graph of has at least
orientable surface embeddings with one face. By Theorem 6, every one of orientable surface embeddings with one face of the current graph of
, there exists a quadrangular embedding of
into an orientable surface, and the orientable genus
. Therefore, the complete graph
has at least
orientable quadrangular embeddings, and the orientable genus is
.
If the current graph of has nontrivial strong automorphism (see Fig. 1 and Fig. 9), then,
, and
; or,
, and
. If
, and
, then,
,
. If
, and
, then,
,
. If
and
, then,
,
)
. Therefore, the current graph of
has no nontrivial strong automorphism.
From the above results and Theorem 7, we get the proof of Theorem 8.
4 The Edge-Colorings
Theorem 9
has at least twenty-four proper 4-edge-colors.
Proof
can be decomposed into two Hamiltonian cycles,
and
.
and
are the four colors. From the four colors, choose two colors to color the edges of
, and two proper 2-edge-color of
can be obtained. We color the edges of
with the remaining two colors, and get two proper 2-edge-colors of
. Therefore,
has at least
proper 4-edge-colors.
Theorem 10 The complete graph (
is an odd number) has at least
nonisomorphic orientable quadrangular embeddings, and the orientable genus is
. Every one of the nonisomorphic orientable quadrangular embeddings has at least twenty-four 4-edge-colors, and each color appears around each face of orientable quadrangular embeddings.
Proof
is a current graph of the complete graph
, the valency of each vertex of
is 4. Applying Theorem 8,
has at least
nonisomorphic orientable quadrangular embeddings, and the orientable genus is
. Applying Theorem 6, each face of orientable quadrangular embeddings of
corresponds to a vertex of
. Let
be a face of quadrangular embeddings of
;
and
are vertices of
;
is an edge of
;
and
are endpoints of
;
is an edge of the current graph
of
, and
has the current
;
corresponds to an endpoint of
. If
:
is a proper 4-edge-color of the current graph
. Then,
is a 4-edge-color of the quadrangular embeddings of
into an orientable surface, and each color appears around each face of orientable quadrangular embeddings. By Theorem 9, every one of the nonisomorphic orientable quadrangular embeddings of
has at least twenty-four 4-edge-colors, and each color appears around each face of orientable quadrangular embeddings.
References
- Korzhik V P, Voss H J. On the number of nonisomorphic orientable regular embeddings of complete graphs[J]. Journal of Combinatorial Theory, Series B, 2001, 81(1): 58-76. [Google Scholar]
- Liu Y P. Embeddability in Graphs[M]. Dordrecht: Springer-Verlag, 1996. [Google Scholar]
- Xuong N H. How to determine the maximum genus of a graph[J]. Journal of Combinatorial Theory, Series B, 1979, 26(2): 217-225. [Google Scholar]
- Liu Y P. The maximum orientable genus of some kinds of graph[J]. Acta Math Sinica, 1981, 24: 817-832. [MathSciNet] [Google Scholar]
- Liu Y P. The maximum orientable genus of a graph[J]. Scientia Sinica, 1979, 9(S1): 192-201. [MathSciNet] [Google Scholar]
- Škoviera M. The maximum genus of graphs of diameter two[J]. Discrete Mathematics, 1991, 87(2): 175-180. [CrossRef] [MathSciNet] [Google Scholar]
- Ringel G. Map Color Theorem[M]. Berlin: Springer-Verlag, 1974. [CrossRef] [Google Scholar]
- Bonnington C P, Grannell M J, Griggs T S, et al. Exponential families of non-isomorphic triangulations of complete graphs[J]. Journal of Combinatorial Theory, Series B, 2000, 78(2): 169-184. [CrossRef] [MathSciNet] [Google Scholar]
- Goddyn L, Richter R B, Širáň J. Triangular embeddings of complete graphs from graceful labellings of paths[J]. Journal of Combinatorial Theory, Series B, 2007, 97(6): 964-970. [Google Scholar]
- Korzhik V P, Voss H J. Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs[J]. Journal of Combinatorial Theory, Series B, 2004, 91(2): 253-287. [Google Scholar]
- Lawrencenko S, Negami S, White A T. Three nonisomorphic triangulations of an orientable surface with the same complete graph[J]. Discrete Mathematics, 1994, 135(1/2/3): 367-369. [CrossRef] [MathSciNet] [Google Scholar]
- Korzhik V P. Generating nonisomorphic quadrangular embeddings of a complete graph[J]. Journal of Graph Theory, 2013, 74(2): 133-142. [CrossRef] [MathSciNet] [Google Scholar]
- Hartsfield N, Ringel G. Minimal quadrangulations of orientable surfaces[J]. Journal of Combinatorial Theory, Series B, 1989, 46(1): 84-95. [CrossRef] [MathSciNet] [Google Scholar]
- Hartsfield N, Ringel G. Minimal quadrangulations of nonorientable surfaces[J]. Journal of Combinatorial Theory, Series A, 1989, 50(2): 186-195. [Google Scholar]
- Liu W Z, Lawrencenko S, Chen B F, et al. Quadrangular embeddings of complete graphs and the even map color theorem[J]. Journal of Combinatorial Theory, Series B, 2019, 139: 1-26. [CrossRef] [MathSciNet] [Google Scholar]
- Liu W Z, Ellingham M N, Ye D. Minimal quadrangulations of surfaces[J]. Journal of Combinatorial Theory, Series B, 2022, 157: 235-262. [Google Scholar]
- Mohar B, Thomassen C. Graphs on Surfaces[M]. Baltimore: The Johns Hopkins University Press, 2001. [CrossRef] [Google Scholar]
All Figures
![]() |
Fig. 1
![]() ![]() |
In the text |
![]() |
Fig. 2 Hamiltonian cycle ![]() |
In the text |
![]() |
Fig. 3 Hamiltonian cycle ![]() |
In the text |
![]() |
Fig. 4
![]() ![]() |
In the text |
![]() |
Fig. 9 Underlying graph of the current graph of![]() |
In the text |
![]() |
Fig. 10 The construction of quadrangle |
In the text |
![]() |
Fig. 11 The local picture of the current graph of Case 1 |
In the text |
![]() |
Fig.12 The local picture of the current graph of Case 2 |
In the text |
![]() |
Fig. 13 The local picture of the current graph of Case 3 |
In the text |
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.