Stable Bi-Maps on Surfaces and Their Graphs

ABSTRACT In this paper we study stable bi-maps F = ( f 1 , f 2 ) : M → ℝ × ℝ 2 from a global viewpoint, where M is a smooth closed orientable surface and f 1 : M → ℝ , f 2 : M → ℝ 2 are stable maps. We associate a graph to F, so-called ℛℳ-graph and study its properties. The ℛℳ-graph captures more information about the topological structure of M than other graphs that appear in literature. Moreover, some graph realization theorems are obtained.


INTRODUCTION
The graph theory has been increasingly used to solve various real-world problems, beyond, of course, the Mathematics problems.The graph theory has applications in Optimization (logistic and transportation problems), Organic Chemistry, Physics (statistical mechanics and solid state Physics), Electrical Engineering (communication network and Coding theory), among others.We can find a wide scope of these applications in the references [5,14].Some recent applications of graph theory include genome sequencing, starlight interferometer program and DNA sequence.The special class of bipartite graphs that will appear in this paper has many interesting and even surprising applications (see for instance [16]).
In Singularity theory, many works resort to graph theory to describe local/global invariants and combinatorial models to investigate the recognition and classification problem involving maps or map germs.The authors themselves of this paper have some works in this direction (see, for instance, [3,8]).It is important to highlight that the Singularity theory has many practical applications in Physics, Engineering, Thermodynamic, among others.
In Figure 1, if we consider f 2 as the projection map of the human body shapes (4-a) and (4-d) on the (floor) plane, then the M -graphs associated to f 2 can be used to distinguish them while the R-graphs cannot.To illustrate how the M -graphs associated to f 2 can distinguish different body shapes, see Figure 2.
By the other hand, there are situations in the converse sense: we can have the same M -graphs but the R-graphs are different.See, for instance, the Figure 3, (a) and (b).
Then, it seems natural to consider the pair R-graph and M -graph, instead of considering just one of them.The pair captures more information about the topological structure of M than only one of them.

(a) (b) (c)
Figure 2: M -graphs related to three distinct human body shapes.
In this way, the motivation of this work is to consider stable bi-maps of type F = ( f 1 , f 2 ) : M → R × R 2 and its associated RM -graphs.The RM -graph is exactly the pair formed by the R-graph associated to f 1 and by the M -graph associated to f 2 .Moreover, we can use the RM -graphs to investigate the topological structure of the surface M and of the singular set Σ f 2 .Previously, we showed a possible application of RM -graphs to study patterns of the human body.This kind of application is very interesting to Computer Vision.There will certainly be many other practical applications of such RM -graphs.
The last part of this paper is dedicated to investigate the graph realization problem.This is a very interesting and difficult problem.Given a graph Γ, in which conditions Γ can be realized as an RM -graph associated to some bi-stable map We answer this question in Section 5 for some cases (see Theorems 5.3, 5.4 and 5.5).Recently, many authors have dedicated themselves to the realization problem of R-graphs associated with Morse functions or Morse-Bott functions (see, for instance, the works of L.P. Michalak [12], I. Gelbukh [6], N. Kitazawa [9], among others).The second and third named authors of this paper, have also a recent work about the realization problem of the calls MB-Reeb graphs [2].The MB-Reeb graphs are a kind of generalization of the R-graphs and they were introduced in [2] to investigate the topological classification of circle-valued Morse-Bott functions defined on surfaces.
Some techniques applied here for a M -graph such as surgeries, codimension one transitions, etc., are based on the references [8,13].

STABLE BI-MAPS
Let M be a closed orientable surface and N = R p (p = 1, 2).Two smooth maps f , g : M → N are said to be A -equivalent (or just equivalent) if there are orientation-preserving diffeomorphisms, k : M → M and l : N → N such that g • k = l • f .A smooth map f : M → N is said to be stable if all maps sufficiently closed to f (with respect to Whitney C ∞ -topology) are equivalent to f (see [7] for more details).
a stable bi-map notice that we have the following properties: That is, every critical point of f 1 is non-degenerate and each critical level curve of f 1 has a finite number of critical points, all distincts.
b) Since f 2 : M → R 2 is stable then its singular points are only folds and isolated cups.Remind that a point p ∈ M is a regular point of f 2 if the map f 2 is a local diffeomorphism around p. Otherwise, the point p is said to be a singular point.According to Whitney theorem (cf.[18]), the singularities of any stable map f 2 : M −→ R 2 are (locally) of fold type (x, y) → (x, y 2 ) or of cusp type (x, y) → (x 3 + yx, y).c) The set of all singular points of f 2 , denoted by Σ f 2 , is called singular set of f 2 .The singular set of f 2 consists of (finitely many) disjoint embedded closed curves in M. The image of singular set of f 2 , i.e., f 2 (Σ f 2 ), is called the apparent contour of f 2 .The apparent contour of f 2 is a finite number of immersed closed plane curves with finite number of cups and finite number of transverse intersections and self-intersections (disjoint from the set of cups).The regular set of f 2 , given by M \ Σ f 2 , consists of all regular points of f 2 .Since M is a smooth closed orientable surface, the singular set Σ f 2 is a finite collection of closed regular simple curves on M formed by fold points with possible isolated cusp points that divide M in a set of regular regions.
Let j : M → R 3 be an immersion of M in R 3 and ⃗ v ̸ = 0 be any vector in R 3 .We can decompose , where R v is a parallel line to ⃗ v and P v is a orthogonal plane to ⃗ v.
Then we can consider two stable projections as following: 1. π 1 v : j(M) → R v given by the restriction to j(M) of the canonical projection of R 3 in R v .
2. π 2 v : j(M) → P v given by the restriction to j(M) of the canonical projection of R 3 in P v .
Let h : R v → R and g : P v → R 2 be diffeomorphisms and consider f 1 : M → R and f 2 : M → R 2 two stable maps.Then we can define the following stable maps using π 1 v and π 2 v : These stable maps f 1 and f 2 as above defined are called projection to a parallel line to ⃗ v and projection to an orthogonal plane to ⃗ v, respectively, associated to the immersion j (see Figure 3).
Observe that when f 1 is a projection to a parallel line to ⃗ v and f 2 is a projection to a orthogonal plane to ⃗ v, then the pair F = ( f 1 , f 2 ) is clearly a stable bi-map.
From now one, we will always consider in this paper stable bi-maps F = ( f 1 , f 2 ) where f 1 is a projection to a parallel line ⃗ v, f 2 is a projection to an orthogonal plane to ⃗ v and ⃗ v ̸ = 0 is a fixed vector in R 3 .
Figure 3: Example of stable bi-maps from sphere.
The Figure 3 illustrates three different stable bi-maps from sphere S 2 .Notice that in (a) and (b), the projections to the orthogonal plane P v have the same number of connected components of the singular set, while the projections to R v have distinct number of singular points.Already in (b) and (c), the projections to R v have the same number of singular points while the projections to P v have distint numbers of singular curves.In this way, the classsical invariant related to stable projections to the orthogonal plane P v do not distinguish (a) and (b) but they distinguish (b) and (c).By other hand, the classical invariant associated to the projections to the parallel line R v can distinguish (a) and (b) but not (b) and (c).
In fact, the classical invariant associated to the projection to R v (i.e., the stable map f 1 ) was codified in the literature by the Reeb graph associated to f 1 .The Reeb graphs were introduced by Reeb in [15].Here the Reeb graphs will be denoted by R-graphs.The next Subsection 3.1 will be dedicated to explain the R-graphs.
By other hand, the classical invariant associated to the projection to P v (i.e., the stable map f 2 ) was codified in the literature by Hacon-Mendes-Romero in [8], by a graph with weights in the vertices.Here these graphs will be denoted by M -graphs or Mendes-graphs.The next Subsection 3.2 will be dedicated to explain the M -graphs.This suggests that these two graphs togheter may give more information to differ two immersions of M in R 3 that just one of them.This is our motivation to introduce, in the next Section, the called RM -graph which is a pair of graphs.

RM -GRAPHS ASSOCIATED TO BI-STABLE MAPS
Given a smooth closed orientable surface M, let j : M → R 3 be an embedding and as said before, let us consider bi-stable maps of type where f 1 is a projection in a line and f 2 is a projection on a plane.By simplicity, if we consider R v = R and where In the next pictures, the RM -graphs will be illustrated always in this order In an RM -graph, the R-graph contributes to determine the position of the maximum and minimum points (local and global) of f 1 while the M -graph contributes to determine the position of the regular regions and singular curves of f 2 in M.

R-graphs
Given a stable map f 1 : M → R we consider the following equivalence relation on M: x ∼ y ⇔ f 1 (x) = f 1 (y) and x and y are in the same connected component of f −1 1 ( f 1 (x)).Then the quotient space M/ ∼ admits the structure of a connected graph where the vertices are the connected components of critical level curves f −1 1 (v) which contains critical points of f 1 and each edge is formed by points that correspond to connected components of level curves f −1 1 (w), where w ∈ R is a regular value and v ∈ R is a critical value of f 1 .
Each vertex of the graph can be of three types, depending on the critical points in the connected component as shown in Figure 6.Let v 1 , . . ., v r ∈ R be the critical values of f 1 .We choose a base point v 0 ∈ R and an orientation.We can reorder the critical values such that v 0 ≤ v 1 < • • • < v r and we label each vertex with the index i ∈ {1, . . ., r}, if it corresponds to the critical value v i .Definition 3.2.The graph given by M/ ∼ together with the labels of the vertices, as previously defined, is said to be the Reeb graph (or R-graph) associated to f 1 : M → R. It is known that the Reeb graph is a complete topological invariant for stable functions (cf.[1]).The example in Figure 7 shows that the R-graph is an invariant that distinguishes what the image set of the critical points cannot tell us.
Follows from the possible incidence rules of edges and vertices in an R-graph that all its vertices have degree 1 or 3. Graphs with this property will be called here 1-trivalent graphs.
Hence, the R-graph associated to a stable map f 1 is 1-trivalent.Moreover, the Euler characteristic of M is given by χ(M) = 2(V 1 − E 1 ).In other words, the topology of surface M can be determined by the R-graph associated to f 1 .
Follows from the Poincaré-Hopf theorem that every R-graph associated to a stable map

M -graphs
Given a stable map f 2 : M → R 2 , its topological information may be conveniently encoded in a determined weighted graph.In fact, given the pair (M, Σ f 2 ), we may reconstruct (up to diffeomorphism) a weighted graph associated to f 2 (cf.[8]), in the following sense: the edges and vertices of this weighted graph correspond to the singular curves and the connected components Trends Comput.Appl.Math., 24, N. 2 (2023) of the regular set, respectively.An edge is incident to a vertex if and only if the corresponding singular curve to the edge lies in the boundary of the regular region corresponding to the vertex.The weight of a vertex is defined as the genus of the corresponding region.This graph is called M -graph (or Mendes-graph) associated to f 2 .
It is known that the M -graph is a complete topological invariant for stable maps from M to the plane (cf.[8]).
Let G 2 (V 2 , E 2 ,W 2 ) be the M -graph associated to f 2 , where V 2 , E 2 and W 2 correspond to the number of vertices, edges and the total weight of the graph, respectively.Then E 2 represents the number of connected components of Σ f 2 ; V 2 the number of connected components of M \ Σ f 2 and W the total sum of genus of the components of M \ Σ f 2 .
If W 2 = 0, that is, if G 2 is a graph without weight, we will denote by simplicity G 2 (V 2 , E 2 ) omitting W 2 in the graph notation.The Figure 8 illustrates two stable maps f 2 , g 2 : S 2 → R 2 whose M -graphs are non equivalent, where j i indicates the respective embedding from S 2 in R 3 and π i the canonical projection, i = 1, 2. This example shows that the M -graph is an invariant that distinguishes what the apparent contour sets of f 2 and g 2 can not distinguish.
Given a stable map f 2 : M → R 2 always it is possible to obtain its M -graph associated.Moreover, the Euler characteristic of M is given by χ In other words, the topology of surface M can be determined by Given the orientations of M and R 2 , a region of M is said to be positive (resp.negative) if the map f 2 preserves (resp.reverses) orientation.Since each component of Σ f 2 is the boundary of a positive and a negative region, the signs of the vertices are assigned alternately, that is, the M -graph associated to stable map f 2 : M → R 2 is bipartite.
To be a bipartite graph is a necessary condition for a graph to be a M -graph for some stable map Theorem 3.2.( [8]) Any bipartite connected graph (with arbitrarily weighted vertices) is the M -graph of a stable map f 2 : M → R 2 .
The proof of Theorem 3.2 is based in a convenient manipulation of codimension one transitions (lips and beaks) in the space C ∞ (M, R 2 ) and convenient surgeries of stable maps (see [8] for more details).Transitions and surgeries involving stable maps will be treated with more details in the next Section.
As a consequence of Theorem 3.2, any tree with W 2 = 0 may be realized as the M -graph of some stable map f 2 : From now on, we focus on M -graphs without weighted vertices (that is, W 2 = 0).The case W 2 > 0 will be studied in a future work in progress.

TOOLS USED TO CONSTRUCT STABLE BI-MAPS
In this work we are considering stable bi-maps of type F = ( f 1 , f 2 ) : M → R × R 2 which can be decomposed (locally) as f i = π i • j, i = 1, 2, where j is an embedding from M in R 3 and π i are the canonical projections from j(M) to R and R 2 , respectively, i = 1, 2. Replacing the embedding j by another embedding from M in R 3 , we can obtain new stable bi-maps.This procedure can be done by taking small perturbations of the embedding j, so that they may alter or not the images of the projections π 1 and π 2 .The new stable bi-maps in this procedure have associated new RM -graphs.Then, it is natural to ask whether these changes modify the new RM -graphs or not.
The alterations used here to obtain new stable bi-maps correspond to transitions and surgeries and they are described with more details in the next Subsections.

Elementary Morse transitions
In this Subsection let us consider stable maps in E ∞ (M, R).
A Morse transition corresponds to an isotopy from a given stable map to another in a different path component of E ∞ (M, R).Thus, a Morse transition allows to transform a stable map f 1 : M → R in another f1 : M → R in such a way that their respective R-graphs have a different number of vertices or the same number of vertices with noncompatible labels.
A Morse transition T is called elementary if the isotopy T transforms f 1 in f1 through one of the following ways: [C ] The isotopy T creates a new edge in R-graph of f 1 .That is, if T (0) = f 1 and its R-graph has s saddles and m max/min points then T (1) = f1 and the R-graph of f1 has s +1 saddles and m + 1 max/min points, with the new saddle and max/min point being connected by a new edge.
[−C ] It is the inverse transition of C. That is, when the isotopy collapses an edge of R-graph of f 1 , with the vertices that were removed being previously connected by an edge.In this case, the R-graph of f1 has s − 1 saddles and m − 1 max/min points.
The Figure 9 indicates examples of elementary Morse transitions.
Figure 9: The effect of the elementary Morse transitions in the R-graphs.
For more details about the consequences of Morse transitions in a Reeb graph see [10].
Since elementary Morse transitions do not generate any new critical curve related to projection π 2 (in the plane), the M -graph has no change after C or −C transitions.In other words, elementary Morse transitions alter the RM -graph associated to original stable bi-map F = ( f 1 , f 2 ) = (π 1 • j, π 2 • j), changing only its R-graph.
Definition 4.3.Given a R-graph G 1 , we say that a C transition is a 1-extension over the graph G 1 .
A sequence of n 1-extensions over a R-graph increases n vertices of degree 1 (max/min points) and n vertices of degree 3 (saddles) over the original R-graph.
)) be the RM -graph associated to G.After a sequence with (V 1 − 2)/2 1-extensions over the RM -graph of G without altering the singular set of g 2 , we obtain a new stable bi-map ).In fact, each 1-extension increases two edges and two vertices in the R-graph and do not alter the M -graph.□

Lips, beaks and swallowtail transitions
In this Subsection we will consider transitions that alter only the M -graph in a RM -graph associated to a stable bi-map They are the same transitions that change the regular and singular sets of f 2 , namely the lips transitions, denoted by L and beaks transitions, denoted by B (see Figure 10).We denote by −B and −L, respectively, the inverse transitions of B and L. These transitions also change the number of cusps by ±2 and they are sufficient to show that any tree with weight equal zero can be realized as a graph of a stable map from S 2 to R 2 (see [8]).Let G 2 (V 2 , E 2 ) be the M -graph (without weight) associated to a stable map f 2 : M → R 2 .Then, the lips transition increases by 1 the number of regions in M (i.e., vertices in V 2 ) and the number of singular curves in M (i.e., edges in E 2 ).The beaks transition can be classified in four different cases (see Figure 12): B − v : beaks transition decreases by 1 the number of regular regions, therefore it removes 1 vertex and 1 edge on the M -graph (see Figure 13); B + w : beaks transition increases by 1 the weight, maintains the number of regular regions (vertices) but decreases by 1 the number of edges (see Figure 11); B − w : beaks transition decreases by 1 the weight, maintains the number of regular regions (vertices) but increases by 1 the number of edges.The four types of beaks transition are illustrated (locally) in Figure 12, where in the picture X, X 1 , Y, Z, Z 1 and Z 2 denote (locally) the regular regions where the transitions hold and the numbers 1 and 2 represent the number of singular curves.
Definition 4.4.Given a M -graph G 2 (V 2 , E 2 ) (without weight), we say that a composition of a lips transition with a beaks transition (in this order) a 2-extension a M -graph when: 1. a lips transition L creates a singular curve α with 2 cusps and 1 new regular region D; 2. a beaks transition −B − v eliminates the 2 cusps, dividing α into two new singular curves and border of the new region D ′ , as illustrate Figure 13.Lips and beaks transitions can modify the singular set of a stable map from M to the plane, and do not alter the singular set of the height function.That is, the R-graphs are preserved by 2extensions while the M -graphs always add two vertices (linked by one edge) with degree two on the graph.The Figure 13 illustrates a sequence of transitions that alter the M -graph but they do not the R-graph.Definition 4.5.We call line graph, and denoted it by L 2 (k), a graph with k vertices with degree 2 and k − 1 edges.
In the Figure 13  Applying 2-extensions we can show that all line graph L 2 (k) is a M -graph of some stable map f 2 : S 2 → R 2 .This is a consequence of Theorem 3.2.

Surgeries of stable bi-maps
Are considered two types of surgeries of stable bi-maps: horizontal and vertical surgeries.We are interested to know the effects of these surgeries over the RM -graphs.This study is based in the concepts introduced in [8].
a bi-stable map, P and Q be two any regions of surface M, where M may or may not be connected.
Horizontal surgery S h : Let p ∈ P, q ∈ Q be two singular points of f 2 .A bridge is an embedded arc β in R 2 , which connects the set of singular values of f 2 (or apparent contour) in its two end points (and nowhere else).A new stable map f 2h can be constructed as follows: the bridge links the apparent contour of f 2 in its points, f 2 (p) and f 2 (q).Choose small disks D p , D q in M centered at p, q ∈ Σ f 2 We can choose small enough disks such that they do not contain any critical point of f 1 .Replace the interiors of D p and D q by a tube (i.e., an annulus) connecting these two small disks obtaining a new connected surface N. Then f 1 and f 2 may be extended over the tube to give new stable maps f 1h and f 2h , in such way that f 1 has only 2 saddle points in this tube, as shown (locally) in Figure 14.
The horizontal surgery S h connects the two regular regions of f 1 and adds 2 saddle points, while in f 2 the horizontal surgery S h effects are: i) it links the 2 singular curves if p and q are in two disjoint singular curves (see the graphs in Figure 16   ii) it separates a singular curve into two curves, if p and q are in the same singular curve (see the graphs in Figure 16 (c)).
Vertical surgery S v : Let p ∈ P, q ∈ Q be two singular points of f 2 .We take a surgery between P e Q by identifying two small topological disks D p and D q , one positive and one negative, such that each one of them contains only 1 critical point of f 1 in their interior being 1 maximum and 1 minimum, and its boundary is a connected component of a regular level curve of f 1 .The disks are replaced by a tube which is mapped into R, with no singular points in the interior of the tube.
The stable map f 1 may be extended over the tube to a new stable map f 1v from a new connected surface N to R. Also, the stable map f 2 can be extended to a new stable map f 2v : N → R 2 with one fold curve in the tube (see Figure 15).
The vertical surgery S v identifies a neighborhood of a maximum point of f 1 as a neighborhood of a minimum point of f 1 , eliminating two singular points.In f 2 , the surgery S v always creates a new singular curve.In other words, the vertical surgery S v takes away two critical points of the singular set Σ f 1 while it adds one critical curve to Σ f 2 (see Figure 15 and 16-(b)).
Notice that the regions P and Q can be in a same connected component of M or in two different connected components.If P and Q are regions of the same connected component of M the singular points p, q ∈ Σ f 2 may or may not be in the same singular curve.
We denote by S h ( f 1 , f 2 ) = ( f 1h , f 2h ) : N → R × R 2 the new stable bi-map resulting after the horizontal surgery S h , and by S h (G ) the effect in the graph G after applying a horizontal surgery S h .Analogously we denote by bi-map resulting after the vertical surgery S v and by S v (G ) the effect in the graph G after applying a vertical surgery S v .
Let P and Q be two regions of M that are in two connected component of M, then the surgeries S h and S v over P and Q are called connected horizontal sum (see Figure 15-(a)) and connected vertical sum (see Figure 15-(a)).
Definition 4.6.We denote by S h1 (resp.S v1 ) the horizontal surgery (resp.vertical surgery) of stable maps from M to the plane that connects two regions of a connected surface M. We denote by S h0 (resp.S v0 ) the horizontal surgery (resp.vertical surgery) that connects two regular regions of two different connected components of M.
This local process of f 2 , for S ηα (η = h, v and α = 0, 1) is illustrated in Figures 14 and 15, which shows the effect of these surgeries on the graphs.It induces the following surgeries on the R-graphs and M -graphs (see Figure 15): A horizontal surgery on graphs which identifies two edges ur and vs, identifying the vertices u with v and r with s, will be denoted by: (a) S h0 : when ru and sv are in different connected graphs, joining these two graphs (Figure 14 ii) If k is even, we can first obtain a stable bi-map H = (h 1 , h 2 ) which realizes the graph (G 1 (2, 1), L 2 (k + 1)) as done in item i).Then, we can obtain a stable bi-map F = ( f 1 , f 2 ) : tree and G 2 is a tree whithout weights then the graph Proof.Let G 1 (V 1 ,V 1 − 1) be a 1-trivalent tree and G 2 (V 2 ,V 2 − 1) be a tree with W 2 = 0. Consider L 2 (k + 1) the biggest line subgraph of G 2 (V 2 ,V 2 − 1).Then by Lemma 5.1, the graph (G 1 (2, 1), L 2 (k + 1)) can be realized by some stable bi-map G = (g 1 , g 2 ) : S 2 → R × R 2 .Since V 1 is even and each 1-extension increases 2 vertices and 1 edge to the R-graph, then passing through a sequence with (V 1 − 2)/2 1-extensions over G = (g 1 , g 2 ) we obtain a stable bi-map ), as required.□ From Poincaré-Hopf theorem, Theorem 3.2 and Proposition 5.3, we obtain the following result: Theorem 5.3.A graph (G 1 , G 2 ) is a RM -graph for a stable bi-map F = ( f 1 , f 2 ) : S 2 → R × R 2 if and only if G 1 is a tree 1-trivalent and G 2 is a tree without weights (i.e., with W 2 = 0).
Proof.Since χ(G 1 ) = χ(G 2 ), both graphs have the same number m of cycles.Consider a pair of support trees (T 1 , T 2 ) defined in the following way: ii) T 2 is a spanning tree of G 2 , that is, a tree that contains all the vertices of G 2 , obtained by removing one edge of each cycle of G 2 .
By Theorem 5.3, (T 1 , T 2 ) is a RM -graph of a stable bi-map G = (g 1 , g 2 ) : Consider the regions U i1 and U i2 of S 2 corresponding to the neighborhoods of the points associated with a pair of vertices v i1 and v i2 obtained in (i), respectively.For each pair of vertices v i1 and v i2 , we may realize a vertical surgery over U i1 and U i2 obtaining a new stable bi-map where M is a surface with genus m) which realizes the RM -graph (G 1 , G 2 ).□ The next result is a consequence of the previous results and remarks.

Figure 4 :
Figure 4: R-graphs and M -graphs corresponding to the Figure 3.

Figure 5 :
Figure 5: Examples of R-graphs and M -graphs associated to stable maps on sphere.

Figure 6 :
Figure 6: Incidence rules for the vertices in a Reeb graph.

Figure 7 :
Figure 7: Examples of R-graphs from sphere.

Figure 8 :
Figure 8: Examples of M -graphs associated to stable maps from sphere.

Figure 11 :
Figure 11: Beaks transition and C-transition on the torus.
we have three examples of M -graphs which are line graphs: (a) L 2 (2); (b) L 2 (3) and (c) L 2 (4).Moreover, the lips transition L holds in a positive region of S 2 creating a new singular curve with 2 cusps (see (b)).The beaks transition −B − v in the negative new region eliminates 2 cusps and adding a new singular curve (see (c)). (a)-(b));
-(a)).(b) S h1 : when ru and sv are in the same connected component of a graph, creating a new cycle in the graph (see Figure 14-(b) and (c)).

i) T 1
is obtained by choosing one edge in each one of the m cycles of G 1 and subdividing each chosen edge obtaining m new vertices of degree 2. Then we cleave each new vertex v i (i = 1, • • • , m) in to two new vertices v i1 and v i2 , obtaining 2m new vertices of degree 1.
If k is odd, k −1 is even.Passing through a sequence with (k − 1)/2 of 2-extensions (without altering the singular set of g 1 ), we obtain a stable bi-map H = (h 1 , h 2 ) : S 2 → R×R 2 which realizes the graph (G 1 (2, 1), L 2 (k + 1)), because each 2-extension increases two edges and two vertices in the M -graph and does not change the R-graph.After this, we can obtain a stable bi-map F Trends Comput.Appl.Math., 24, N. 2 (2023) i)