Figure 1.
An example of face degree.
In this paper we study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a network (connected one-dimensional structure), that has to be found in a suitable admissible class. We show the existence of an optimal network, and observe that such network carries a multiplicity that in principle can be strictly larger than one. Some numerical simulations are shown to confirm this issue and to illustrate the complexity of the optimal network when the total length becomes large.
Citation: Giovanni Alberti, Giuseppe Buttazzo, Serena Guarino Lo Bianco, Édouard Oudet. Optimal reinforcing networks for elastic membranes[J]. Networks and Heterogeneous Media, 2019, 14(3): 589-615. doi: 10.3934/nhm.2019023
| [1] | Yantao Song, Wenjie Zhang, Yue Zhang . A novel lightweight deep learning approach for simultaneous optic cup and optic disc segmentation in glaucoma detection. Mathematical Biosciences and Engineering, 2024, 21(4): 5092-5117. doi: 10.3934/mbe.2024225 |
| [2] | Rafsanjany Kushol, Md. Hasanul Kabir, M. Abdullah-Al-Wadud, Md Saiful Islam . Retinal blood vessel segmentation from fundus image using an efficient multiscale directional representation technique Bendlets. Mathematical Biosciences and Engineering, 2020, 17(6): 7751-7771. doi: 10.3934/mbe.2020394 |
| [3] | Yue Li, Hongmei Jin, Zhanli Li . A weakly supervised learning-based segmentation network for dental diseases. Mathematical Biosciences and Engineering, 2023, 20(2): 2039-2060. doi: 10.3934/mbe.2023094 |
| [4] | Jianguo Xu, Cheng Wan, Weihua Yang, Bo Zheng, Zhipeng Yan, Jianxin Shen . A novel multi-modal fundus image fusion method for guiding the laser surgery of central serous chorioretinopathy. Mathematical Biosciences and Engineering, 2021, 18(4): 4797-4816. doi: 10.3934/mbe.2021244 |
| [5] | Dehua Feng, Xi Chen, Xiaoyu Wang, Xuanqin Mou, Ling Bai, Shu Zhang, Zhiguo Zhou . Predicting effectiveness of anti-VEGF injection through self-supervised learning in OCT images. Mathematical Biosciences and Engineering, 2023, 20(2): 2439-2458. doi: 10.3934/mbe.2023114 |
| [6] | Ran Zhou, Yanghan Ou, Xiaoyue Fang, M. Reza Azarpazhooh, Haitao Gan, Zhiwei Ye, J. David Spence, Xiangyang Xu, Aaron Fenster . Ultrasound carotid plaque segmentation via image reconstruction-based self-supervised learning with limited training labels. Mathematical Biosciences and Engineering, 2023, 20(2): 1617-1636. doi: 10.3934/mbe.2023074 |
| [7] | Duolin Sun, Jianqing Wang, Zhaoyu Zuo, Yixiong Jia, Yimou Wang . STS-TransUNet: Semi-supervised Tooth Segmentation Transformer U-Net for dental panoramic image. Mathematical Biosciences and Engineering, 2024, 21(2): 2366-2384. doi: 10.3934/mbe.2024104 |
| [8] | Zhenwu Xiang, Qi Mao, Jintao Wang, Yi Tian, Yan Zhang, Wenfeng Wang . Dmbg-Net: Dilated multiresidual boundary guidance network for COVID-19 infection segmentation. Mathematical Biosciences and Engineering, 2023, 20(11): 20135-20154. doi: 10.3934/mbe.2023892 |
| [9] | Wenli Cheng, Jiajia Jiao . An adversarially consensus model of augmented unlabeled data for cardiac image segmentation (CAU+). Mathematical Biosciences and Engineering, 2023, 20(8): 13521-13541. doi: 10.3934/mbe.2023603 |
| [10] | Jingyao Liu, Qinghe Feng, Yu Miao, Wei He, Weili Shi, Zhengang Jiang . COVID-19 disease identification network based on weakly supervised feature selection. Mathematical Biosciences and Engineering, 2023, 20(5): 9327-9348. doi: 10.3934/mbe.2023409 |
In this paper we study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a network (connected one-dimensional structure), that has to be found in a suitable admissible class. We show the existence of an optimal network, and observe that such network carries a multiplicity that in principle can be strictly larger than one. Some numerical simulations are shown to confirm this issue and to illustrate the complexity of the optimal network when the total length becomes large.
To exemplify the phenomena of compounds scientifically, researchers utilize the contraption of the diagrammatic hypothesis, it is a well-known branch of geometrical science named graph theory. This division of numerical science provides its services in different fields of sciences. The particular example in networking [1], from electronics [2], and for the polymer industry, we refer to see [3]. Particularly in chemical graph theory, this division has extra ordinary assistance to study giant and microscope-able chemical compounds. For such a study, researchers made some transformation rules to transfer a chemical compound to a discrete pattern of shapes (graph). Like, an atom represents as a vertex and the covalent bonding between atoms symbolized as edges. Such transformation is known as molecular graph theory. A major importance of this alteration is that the hydrogen atoms are omitted. Some chemical structures and compounds conversion are presented in [4,5,6].
In cheminformatics, the topological index gains attraction due to its implementations. Various topological indices help to estimate a bio-activity and physicochemical characteristics of a chemical compound. Some interesting and useful topological indices for various chemical compounds are studied in [3,7,8]. A topological index modeled a molecular graph or a chemical compound into a numerical value. Since 1947, topological index implemented in chemistry [9], biology [10], and information science [11,12]. Sombor index and degree-related properties of simplicial networks [13], Nordhaus–Gaddum-type results for the Steiner Gutman index of graphs [14], Lower bounds for Gaussian Estrada index of graphs [15], On the sum and spread of reciprocal distance Laplacian eigenvalues of graphs in terms of Harary index [16], the expected values for the Gutman index, Schultz index, and some Sombor indices of a random cyclooctane chain [17,18,19], bounds on the partition dimension of convex polytopes [20,21], computing and analyzing the normalized Laplacian spectrum and spanning tree of the strong prism of the dicyclobutadieno derivative of linear phenylenes [22], on the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks [23,24], Zagreb indices and multiplicative Zagreb indices of Eulerian graphs [25], Minimizing Kirchhoff index among graphs with a given vertex bipartiteness, [26], asymptotic Laplacian energy like invariant of lattices [27]. Few interesting studies regarding the chemical graph theory can be found in [28,29,30,31,32].
Recently, the researchers of [33] introduced a topological descriptor and called the face index. Moreover, the idea of computing structure-boiling point and energy of a structure, motivated them to introduced this parameter without heavy computation. They computed these parameters for different models compare the results with previous literature and found approximate solutions with comparatively less computations. This is all the blessings of face index of a graph. The major concepts of this research work are elaborated in the given below definitions.
Definition 1.1. [33] Let a graph $ G = \left(V(G), E(G), F(G)\right) $ having face, edge and vertex sets notation with $ F(G), E(G), V(G), $ respectively. It is mandatory that the graph is connected, simple and planar. If $ e $ from the edge set $ E(G), $ is one of those edges which surrounds a face, then the face $ f $ from the face set $ F(G), $ is incident to the edge $ e. $ Likewise, if a vertex $ \alpha $ from the vertex set $ V(G) $ is at the end of those incident edges, then a face $ f $ is incident to that vertex. This face-vertex incident relation is symbolized here by the notation $ \alpha\sim f. $ The face degree of $ f $ in $ G $ is described as $ d(f) = \sum_{\alpha\sim f}{d\left(\alpha\right)}, $ which are elaborated in the Figure 1.
Definition 1.2. [33] The face index $ FI\left(G\right), $ for a graph $ G, $ is formulated as
|
$ FI(G)=∑f∈F(G)d(f)=∑α∼f,f∈F(G)d(α). $
|
In the Figure 1, we can see that there are two faces with degree $ 4, $ exactly two with five count and four with count of 6. Moreover, there is an external face with count of face degree $ 28, $ which is the count of vertices.
As the information given above that the face index is quite new and introduced in the year 2020, so there is not so much literature is available. A few recent studies on this topic are summarized here. A chemical compound of silicon carbides is elaborated with such novel definition in [34]. Some carbon nanotubes are discussed in [35]. Except for the face index, there are distance and degree-based graphical descriptors available in the literature. For example, distance-based descriptors of phenylene nanotube are studied in [36], and in [37] titania nanotubes are discussed with the same concept. Star networks are studied in [38], with the concept of degree-based descriptors. Bounds on the descriptors of some generalized graphs are discussed in [39]. General Sierpinski graph is discussed in [40], in terms of different topological descriptor aspects. The study of hyaluronic acid-doxorubicin ar found in [41], with the same concept of the index. The curvilinear regression model of the topological index for the COVID-19 treatment is discussed in [42]. For further reading and interesting advancements of topological indices, polynomials of zero-divisor structures are found in [43], zero divisor graph of commutative rings [44], swapped networks modeled by optical transpose interconnection system [45], metal trihalides network [46], some novel drugs used in the cancer treatment [47], para-line graph of Remdesivir used in the prevention of corona virus [48], tightest nonadjacently configured stable pentagonal structure of carbon nanocones [49]. In order to address a novel preventive category (P) in the HIV system known as the HIPV mathematical model, the goal of this study is to offer a design of a Morlet wavelet neural network (MWNN) [50].
In the next section, we discussed the newly developed face index or face-based index for different chemical compounds. Silicate network, triangular honeycomb network, carbon sheet, polyhedron generalized sheet, and generalized chain of silicate network are studied with the concept of the face-based index. Given that the face index is more versatile than vertex degree-based topological descriptors, this study will aid in understanding the structural characteristics of chemical networks. Only the difficulty authors will face to compute the face degree of a generalized network or structure, because it is more generalized version and taking degree based partition of edges into this umbrella of face index.
Silicates are formed when metal carbonates or metal oxides react with sand. The $ SiO_4, $ which has a tetrahedron structure, is the fundamental chemical unit of silicates. The central vertex of the $ SiO_4 $ tetrahedron is occupied by silicon ions, while the end vertices are occupied by oxygen ions [51,52,53]. A silicate sheet is made up of rings of tetrahedrons that are joined together in a two-dimensional plane by oxygen ions from one ring to the other to form a sheet-like structure. The silicate network $ SL_{n} $ symbol, where $ {n} $ represents the total number of hexagons occurring between the borderline and center of the silicate network $ SL_{n}. $ The silicate network of dimension one is depicted in Figure 2. It contain total $ 3{n}\left(5{n}+1\right) $ vertices are $ 36{n}^2 $ edges. Moreover, the result required is detailed are available in Table 1.
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{36}}}{\bf{|}} $ |
| $ 1 $ | $ 24 $ | $ 48 $ | $ 7 $ |
| $ 2 $ | $ 32 $ | $ 94 $ | $ 14 $ |
| $ 3 $ | $ 40 $ | $ 152 $ | $ 23 $ |
| $ 4 $ | $ 48 $ | $ 222 $ | $ 34 $ |
| $ 5 $ | $ 56 $ | $ 304 $ | $ 47 $ |
| $ 6 $ | $ 64 $ | $ 398 $ | $ 62 $ |
| $ 7 $ | $ 72 $ | $ 504 $ | $ 79 $ |
| $ 8 $ | $ 80 $ | $ 622 $ | $ 98 $ |
| . | . | . | . |
| . | . | . | . |
| . | . | . | . |
| $ {n} $ | $ 8{n}+16 $ | $ 6{n}^{2}+28{n}+14 $ | $ {n}^{2}+4{n}+2 $ |
DownLoad:
CSV
Theorem 2.1. Let $ SL_{n} $ be the silicate network of dimension $ n\geq1. $ Then the face index of $ SL_{n} $ is
|
$ FI(SLn)=126n2+720n+558. $
|
Proof. Consider $ SL_{n} $ the graph of silicate network with dimension $ {n}. $ Suppose $ f_{i} $ denotes the faces of graph $ SL_{n} $ having degree $ i. $ that is, $ d(f_{i}) = \sum_{\alpha\sim f_{i}}{d\left(\alpha\right)} = i $ and $ |f_{i}| $ denotes the number of faces with degree $ i. $ The graph $ SL_{n} $ contains three types of internal faces $ f_{12}, $ $ f_{15}, $ $ f_{36}, $ and single external face which is usually denoted by $ f^{\infty}. $
If $ SL_{n} $ has one dimension then sum of degree of vertices incident to the external face is $ 144 $ and when $ SL_{n} $ has two dimension then sum of degree of incident vertices to the external face is $ 204 $ whenever $ SL_{n} $ has three dimension then sum of degree of incident vertices to the external face is $ 264. $ Similarly, $ SL_{n} $ has $ n- $dimension then sum of degree of incident vertices to the external face is $ 60n+84. $
The number of internal faces with degree in each dimension is mentioned in Table 1.
By using the definition of face index $ FI $ we have
|
$ FI(SLn)=∑α∼f∈F(SLn)d(α)=∑α∼f12∈F(SLn)d(α)+∑α∼f15∈F(SLn)d(α)+∑α∼f36∈F(SLn)d(α)+∑α∼f∞∈F(SLn)d(α)=|f12|(12)+|f15|(15)+|f36|(36)+(60n+84)=(8n+16)(12)+(6n2+28n+14)(15)+(n2+4n+2)(36)+60n+84=126n2+72n+558. $
|
Hence, this is our required result.
A chain silicate network of dimension $ (m, n) $ is symbolized as $ CSL\left(m, n\right) $ which is made by arranging $ (m, n) $ tetrahedron molecules linearly. A chain silicate network of dimension $ (m, n) $ with $ m, n\geq1 $ where $ m $ denotes the number of rows and each row has $ n $ number of tetrahedrons. The following theorem formulates the face index $ FI $ for chain silicate network.
Theorem 2.2. Let $ CSL\left(m, n\right) $ be the chain of silicate network of dimension $ m, n\geq1. $ Then the face index $ FI $ of the graph $ CSL\left(m, n\right) $ is
|
$ FI(CSL(m,n))={48n−12if m=1, n≥1;96m−12if n=1, m≥2;168m−60if n=2,m≥2;45m−9n+36mn−42if both m,n are even45m−9n+36mn−21otherwise. $
|
Proof. Let $ CSL\left(m, n\right) $ be the graph of chain silicate network of dimension $ (m, n) $ with $ m, n\geq1 $ where $ m $ represents the number of rows and $ n $ is the number of tetrahedrons in each row. A graph $ CSL\left(m, n\right) $ for $ m = 1 $ contains three type of internal faces $ f_{9}, \ f_{12} $ and $ f_{15} $ with one external face $ f^{\infty}. $ While for $ m\geq2, $ it has four type of internal faces $ f_{9}, \ f_{12}, \ f_{15} $ and $ f_{36} $ with one external face $ f^{\infty}. $ We want to evaluate the algorithm of face index $ FI $ for chain silicate network. We will discuss it in two different cases.
Case 1: When $ CSL\left(m, n\right) $ has one row $ (m = 1) $ with $ n $ number of tetrahedrons as shown in the Figure 3.
The graph has three type of internal faces $ f_{9}, \ f_{12} $ and $ f_{15} $ with one external face $ f^{\infty}. $ The sum of degree of incident vertices to the external face is $ 9n $ and number of faces are $ |f_{9}| = 2, \ |f_{12}| = 2n $ and $ |f_{15}| = n-2. $ Now the face index $ FI $ of the graph $ CSL\left(m, n\right) $ is given by
|
$ FI(CSL(m,n))=∑α∼f∈F(CSL(m,n))d(α)=∑α∼f9∈F(CSL(m,n))d(α)+∑α∼f12∈F(CSL(m,n))d(α)+∑α∼f15∈F(CSL(m,n))d(α)+∑α∼f∞∈F(CSL(m,n))d(α)=|f9|(9)+|f12|(12)+|f15|(15)+(9n)=(2)(9)+(2n)(12)+(n−2)(15)+9n=48n−12. $
|
Case 2: When $ CSL\left(m, n\right) $ has more than one rows $ (m\neq1) $ with $ n $ number of tetrahedrons in each row as shown in the Figure 4.
The graph has four type of internal faces $ f_{9}, \ f_{12}, \ f_{15} $ and $ f_{36} $ with one external face $ f^{\infty}. $ The sum of degree of incident vertices to the external face is
|
$ ∑α∼f∞∈F(CSL(m,n))d(α)={18mif n=1, m≥1;27mif n=2, m≥1;30m+15n−30if both m,n are even30m+15n−33otherwise. $
|
The number of faces are $ |f_{9}|, \ |f_{12}|, \ f_{15} $ and $ |f_{36}| $ are given by
|
$ |f9|={2if m is odd3+(−1)nif m is even.|f12|={2(2m+n−1)if m is odd4(⌊n+12⌋+2m−1)if m is even|f15|=(3m−2)n−m|f36|={(m−12)(n−1)if m is odd(2n+(−1)n−14)(m−22)nif m is even. $
|
Now the face index $ FI $ of the graph $ CSL\left(m, n\right) $ is given by
|
$ FI(CSL(m,n))=∑α∼f∈F(CSL(m,n))d(α)=∑α∼f9∈F(CSL(m,n))d(α)+∑α∼f12∈F(CSL(m,n))d(α)+∑α∼f15∈F(CSL(m,n))d(α)+∑α∼f36∈F(CSL(m,n))d(α)+∑α∼f∞∈F(CSL(m,n))d(α)=|f9|(9)+|f12|(12)+|f15|(15)+|f36|(36)+∑α∼f∞∈F(CSL(m,n))d(α). $
|
After some mathematical simplifications, we can get
|
$ FI(CSL(m,n))={48n−12if m=196m−12if n=1,∀m168m−60if n=2,∀m45m−9n+36mn−42if both m,n are even45m−9n+36mn−21otherwise. $
|
There are three regular plane tessellations known to exist, each constituted from the same type of regular polygon: triangular, square, and hexagonal. The triangular tessellation is used to define the hexagonal network, which is extensively studied in [54]. A dimensioned hexagonal network $ TH_{k} $ has $ 3{k}^2-3{k}+1 $ vertices and $ 9{k}^2-15{k}+6 $ edges, where $ {k} $ is the number of vertices on one side of the hexagon. It has $ 2{k}-2 $ diameter. There are six vertices of degree three that are referred to as corner vertices. Moreover, the result required detailed are available in the Table 2.
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ |
| $ 1 $ | $ 6 $ | $ 0 $ | $ 0 $ | $ 0 $ |
| $ 2 $ | $ 6 $ | $ 12 $ | $ 12 $ | $ 12 $ |
| $ 3 $ | $ 6 $ | $ 24 $ | $ 24 $ | $ 60 $ |
| $ 4 $ | $ 6 $ | $ 36 $ | $ 36 $ | $ 144 $ |
| $ 5 $ | $ 6 $ | $ 48 $ | $ 48 $ | $ 264 $ |
| $ 6 $ | $ 6 $ | $ 60 $ | $ 60 $ | $ 420 $ |
| $ 7 $ | $ 6 $ | $ 72 $ | $ 72 $ | $ 612 $ |
| $ 8 $ | $ 6 $ | $ 84 $ | $ 84 $ | $ 840 $ |
| . | . | . | . | . |
| . | . | . | . | . |
| . | . | . | . | . |
| $ {k} $ | $ 6 $ | $ 12({k}-1) $ | $ 12({k}-1) $ | $ 18{k}^{2}-42{k}+24 $ |
DownLoad:
CSV
Theorem 2.3. Let $ TH_{k} $ be the triangular honeycomb network of dimension $ k\geq1. $ Then the face index of graph $ TH_{k} $ is
|
$ FI(THk)=324k2−336k+102. $
|
Proof. Consider $ TH_{k} $ be a graph of triangular honeycomb network. The graph $ TH_{1} $ has one internal and only one external face while graph $ TH_{k} $ with $ k\geq2, $ contains four types of internal faces $ f_{12}, $ $ f_{14}, $ $ f_{17}, $ and $ f_{18} $ with one external face $ f^{\infty}. $
For $ TH_{1} $ the sum of degree of incident vertices to the external face is $ 18 $ and in $ TH_{2} $ the sum of degree of incident vertices to the external face is $ 66. $ Whenever the graph $ TH_{3}, $ the sum of degree of incident vertices to the external face is $ 114. $ Similarly, for $ TH_{k} $ has $ n- $dimension then sum of degree of incident vertices to the external face is $ 48k-30. $
The number of internal faces with degree in each dimension is given in Table 2.
By using the definition of face index $ FI $ we have
|
$ FI(THk)=∑α∼f∈F(THk)d(α)=∑α∼f12∈F(THk)d(α)+∑α∼f14∈F(THk)d(α)+∑α∼f17∈F(THk)d(α)+∑α∼f18∈F(THk)d(α)+∑α∼f∞∈F(THk)d(α)=|f12|(12)+|f14|(14)+|f17|(17)+|f18|(18)+(48k−30)=(6)(12)+(12(k−1))(14)+(12(k−1))(17)+(18k2−42k+24)(18)+48k−30=324k2−336k+102. $
|
Hence, this is our required result.
Given carbon sheet in the Figure 6, is made by grid of hexagons. There are few types of carbon sheets are given in [55,56]. The carbon sheet is symbolize as $ HCS_{{m}, {n}}, $ where $ {n} $ represents the total number of vertical hexagons and $ {m} $ denotes the horizontal hexagons. It contain total $ 4{m}{n}+2\left({n}+{m}\right)-1 $ vertices and $ 6{n}{m}+2{m}+{n}-2 $ edges. Moreover, the result required detailed are available in Tables 3 and 4.
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ {n}-1 $ | $ 20{n}+7 $ |
DownLoad:
CSV
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ 0 $ | $ {n}-1 $ | $ 20{n}+7 $ |
| $ 3 $ | $ 2 $ | $ 2{n} $ | $ 1 $ | $ 3\left({n}-1\right) $ | $ 20{n}+17 $ |
| $ 4 $ | $ 2 $ | $ 2{n} $ | $ 3 $ | $ 5\left({n}-1\right) $ | $ 20{n}+27 $ |
| $ 5 $ | $ 2 $ | $ 2{n} $ | $ 5 $ | $ 7\left({n}-1\right) $ | $ 20{n}+37 $ |
| $ 6 $ | $ 2 $ | $ 2{n} $ | $ 7 $ | $ 9\left({n}-1\right) $ | $ 20{n}+47 $ |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| $ {m} $ | $ 2 $ | $ 2{n} $ | $ 2{m}-5 $ | $ 2{m}{n}-2{m}-3{n}+3 $ | $ 20{n}+10{m}-13 $ |
DownLoad:
CSV
Theorem 2.4. Let $ HCS_{{m}, {n}} $ be the carbon sheet of dimension $ \left({m}, {n}\right) $ and $ {m}, {n}\geq2. $ Then the face index of $ HCS_{{m}, {n}} $ is
|
$ FI(HCSm,n)={70n+2ifm=236mn−14−2(n−4m)ifm≥3. $
|
Proof. Consider $ HCS_{{m}, {n}} $ be the carbon sheet of dimension $ \left({m}, {n}\right) $ and $ {m}, {n}\geq2. $ Let $ {f}_{i} $ denotes the faces of graph $ HCS_{{m}, {n}} $ having degree $ {i}, $ which is $ d(f_{i}) = \sum_{\alpha\sim f_{i}}{d\left(\alpha\right)} = i, $ and $ |f_{i}| $ denotes the number of faces with degree $ i. $ A graph $ HCS_{{m}, {n}} $ for a particular value of $ {m} = 2 $ contains three types of internal faces $ {f}_{15}, $ $ {f}_{16}, $ $ {f}_{17} $ and $ {f}_{18} $ with one external face $ {f}^{\infty}. $ While for the generalize values of $ {m}\geq3, $ it contain four types of internal faces $ {f}_{15}, $ $ {f}_{16} $ and $ {f}_{17} $ with one external face $ {f}^{\infty} $ in usual manner. For the face index of generalize nanotube, we will divide into two cases on the values of $ {m}. $
Case 1: When $ HCS_{{m}, {n}} $ has one row or $ HCS_{{2}, {n}}. $
A graph $ HCS_{{m}, {n}} $ for a this particular value of $ {m} = 2 $ contains three types of internal faces $ \left|{f}_{15}\right| = 3, $ $ \left|{f}_{16}\right| = 2\left({n}-1\right) $ and $ \left|{f}_{18}\right| = {n}-1 $ with one external face $ {f}^{\infty}. $ For the face index of carbon sheet, details are given in the Table 3. Now the face index $ FI $ of the graph $ NT_{{2}, {n}} $ is given by
|
$ FI(HCS2,n)=∑α∼f∈F(HCS2,n)d(α)=∑α∼f15∈F(HCS2,n)d(α)+∑α∼f16∈F(HCS2,n)d(α)+∑α∼f18∈F(HCS2,n)d(α)+∑α∼f∞∈F(HCS2,n)d(α)=|f15|(15)+|f16|(16)+|f18|(18)+20n+7.=3(15)+2(n−1)(16)+(n−1)(18)+20n+7.=70n+2. $
|
Case 2: When $ HCS_{{m}, {n}} $ has $ {m}\geq3 $ rows.
A graph $ HCS_{{m}, {n}} $ for generalize values of $ {m}\geq3 $ contains four types of internal faces $ \left|{f}_{15}\right| = 2, $ $ \left|{f}_{16}\right| = 2{n}, $ $ \left|{f}_{17}\right| = 2{m}-5 $ and $ \left|{f}_{18}\right| = 2{m}{n}-2{m}-3{n}+3 $ with one external face $ {f}^{\infty}. $ For the face index of carbon sheet, details are given in the Table 4. Now the face index $ FI $ of the graph $ NT_{{m}, {n}} $ is given by
|
$ FI(HCSm,n)=∑α∼f∈F(HCSm,n)d(α)=∑α∼f15∈F(HCSm,n)d(α)+∑α∼f16∈F(HCSm,n)d(α)+∑α∼f17∈F(HCSm,n)d(α)+∑α∼f18∈F(HCSm,n)d(α)+∑α∼f∞∈F(HCSm,n)d(α)=|f15|(15)+|f16|(16)+|f17|(17)+|f18|(18)+20n+10m−13.=36mn−2n+8m−14. $
|
Given structure of polyhedron generalized sheet of $ C^{\ast}_{28} $ in the Figure 7, is made by generalizing a $ C^{\ast}_{28} $ polyhedron structure which is shown in the Figure 8. This particular structure of $ C^{\ast}_{28} $ polyhedron are given in [57]. The polyhedron generalized sheet of $ C^{\ast}_{28} $ is as symbolize $ PHS_{{m}, {n}}, $ where $ {n} $ represents the total number of vertical $ C^{\ast}_{28} $ polyhedrons and $ {m} $ denotes the horizontal $ C^{\ast}_{28} $ polyhedrons. It contain total $ 23{n}{m}+3{n}+2{m} $ vertices and $ 33{n}{m}+{n}+{m} $ edges. Moreover, the result required detailed are available in Tables 3 and 5.
| $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{20}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{35}}}{\bf{|}} $ |
| $ 1 $ | $ 2{n}+1 $ | $ 2 $ | $ 4{n}-2 $ | $ 0 $ | $ 0 $ | $ 2{n}-1 $ | $ 0 $ |
| $ 2 $ | $ 2{n}+2 $ | $ 2 $ | $ 8{n}-2 $ | $ 2 $ | $ 2{n}-2 $ | $ 4{n}-2 $ | $ 2{n}-1 $ |
| $ 3 $ | $ 2{n}+3 $ | $ 2 $ | $ 12{n}-2 $ | $ 4 $ | $ 4{n}-4 $ | $ 6{n}-3 $ | $ 4{n}-2 $ |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| $ {m} $ | $ 2{n}+{m} $ | $ 2 $ | $ 4{m}{n}-2 $ | $ 2{m}-2 $ | $ 2{m}{n}-2\left({m}+{n}\right)+2 $ | $ 2{m}{n}-{m} $ | $ 2{m}{n}-\left({m}+2{n}\right)+1 $ |
DownLoad:
CSV
Theorem 2.5. Let $ PHS_{{m}, {n}} $ be the polyhedron generalized sheet of $ C^{\ast}_{28} $ of dimension $ \left({m}, {n}\right) $ and $ {m}, {n}\geq1. $ Then the face index of $ PHS_{{m}, {n}} $ is
|
$ FI(PHSm,n)=210mn−2(3m+5n). $
|
Proof. Consider $ PHS_{{m}, {n}} $ be the polyhedron generalized sheet of $ C^{\ast}_{28} $ of dimension $ \left({m}, {n}\right) $ and $ {m}, {n}\geq1. $ Let $ {f}_{i} $ denotes the faces of graph $ PHS_{{m}, {n}} $ having degree $ {i}, $ which is $ d(f_{i}) = \sum_{\alpha\sim f_{i}}{d\left(\alpha\right)} = i, $ and $ |f_{i}| $ denotes the number of faces with degree $ i. $ A graph $ PHS_{{m}, {n}} $ for the generalize values of $ {m}, {n}\geq1, $ it contain seven types of internal faces $ {f}_{14}, {f}_{15}, {f}_{16}, {f}_{17}, {f}_{18}, {f}_{20} $ and $ {f}_{35} $ with one external face $ {f}^{\infty} $ in usual manner. For the face index of polyhedron generalized sheet, details are given in the Table 5.
A graph $ PHS_{{m}, {n}} $ for generalize values of $ {m}, {n}\geq1 $ contains seven types of internal faces $ \left|{f}_{14}\right| = 2{n}+{m}, $ $ \left|{f}_{15}\right| = 2, $ $ \left|{f}_{16}\right| = 4{n}{m}-2, $ $ \left|{f}_{17}\right| = 2\left({m}-1\right), $ $ \left|{f}_{18}\right| = 2{n}{m}-2\left({m}+{n}\right)+2, $ $ \left|{f}_{20}\right| = 2{n}{m}-2{m}{n}-{m}, $ and $ \left|{f}_{35}\right| = 2{m}{n}-{m}-2{n}+1 $ with one external face $ {f}^{\infty}. $ Now the face index $ FI $ of the graph $ PHS_{{m}, {n}} $ is given by
|
$ FI(PHSm,n)=∑α∼f∈F(PHSm,n)d(α)=∑α∼f14∈F(PHSm,n)d(α)+∑α∼f15∈F(PHSm,n)d(α)+∑α∼f16∈F(PHSm,n)d(α)+∑α∼f17∈F(PHSm,n)d(α)+∑α∼f18∈F(PHSm,n)d(α)+∑α∼f20∈F(PHSm,n)d(α)+∑α∼f35∈F(PHSm,n)d(α)+∑α∼f∞∈F(PHSm,n)d(α)=|f14|(14)+|f15|(15)+|f16|(16)+|f17|(17)+|f18|(18)+|f20|(20)+|f35|(35)+37m+68n−35.=210mn−6m−10n. $
|
With the advancement of technology, types of equipment and apparatuses of studying different chemical compounds are evolved. But topological descriptors or indices are still preferable and useful tools to develop numerical science of compounds. Therefore, from time to time new topological indices are introduced to study different chemical compounds deeply. In this study, we discussed a newly developed tool of some silicate type networks and generalized sheets, carbon sheet, polyhedron generalized sheet, with the face index concept. It provides numerical values of these networks based on the information of faces. It also helps to study physicochemical characteristics based on the faces of silicate networks.
M. K. Jamil conceived of the presented idea. K. Dawood developed the theory and performed the computations. M. Azeem verified the analytical methods, R. Luo investigated and supervised the findings of this work. All authors discussed the results and contributed to the final manuscript.
This work was supported by the National Science Foundation of China (11961021 and 11561019), Guangxi Natural Science Foundation (2020GXNSFAA159084), and Hechi University Research Fund for Advanced Talents (2019GCC005).
The authors declare that they have no conflicts of interest.
| [1] |
On the structure of continua with finite length and Golab's semicontinuity theorem. Nonlinear Anal. (2017) 153: 35-55. 
|
| [2] |
Thin inclusions in linear elasticity: A variational approach. J. Reine Angew. Math. (1988) 386: 99-115.
|
| [3] |
A continuous model of transportation. Econometrica (1952) 20: 643-660.
|
| [4] |
Energies with respect to a measure and applications to low dimensional structures. Calc. Var. Partial Differential Equations (1996) 5: 37-54.
|
| [5] |
Congested traffic dynamics, weak flows and very degenerate elliptic equations. J. Math. Pures Appl. (2010) 93: 652-671.
|
| [6] |
Optimal regions for congested transport. ESAIM Math. Model. Numer. Anal. (2015) 49: 1607-1619.
|
| [7] |
A free boundary problem arising in PDE optimization. Calc. Var. Partial Differential Equations (2015) 54: 3829-3856.
|
| [8] |
G. Buttazzo, É. Oudet and E. Stepanov, Optimal transportation problems with free Dirichlet regions, in Variational Methods for Discontinuous Structures, Progr. Nonlinear Differential Equations Appl., 51, Birkhäuser, Basel, 2002, 41–65. |
| [9] |
Asymptotical compliance optimization for connected networks. Netw. Heterog. Media (2007) 2: 761-777.
|
| [10] |
Asymptotics of an optimal compliance-location problem. ESAIM Control Optim. Calc. Var. (2006) 12: 752-769.
|
| [11] | On the optimal reinforcement of an elastic membrane. Riv. Mat. Univ. Parma (Ser. 7) (2005) 4: 115-125. |
| [12] |
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. (Ser. A) (2006) 106: 403-421.
|
| [13] | (1986) The Geometry of Fractal Sets. Cambridge: Cambridge Tracts in Mathematics, 85, Cambridge University Press. |
| [14] | Sur quelques points de la théorie de la longueur. Ann. Soc. Polon. Math. (1929) 7: 227-241. |
| [15] |
S. G. Johnson, The NLopt nonlinear-optimization package., Available from: http://ab-initio.mit.edu/nlopt. |
| [16] | Γ-convergence for the irrigation problem. J. Convex Anal. (2005) 12: 145-158. |
| [17] |
E. Sánchez-Palencia, Nonhomogeneous Media and Vibration Theory, Lecture Notes in Physics, 127, Springer-Verlag, Berlin-New York, 1980. |
| [18] |
Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers (1952) 1: 325-362.
|
| 1. | Yasunari Matsuzaka, Ryu Yashiro, Applications of Deep Learning for Drug Discovery Systems with BigData, 2022, 2, 2673-7426, 603, 10.3390/biomedinformatics2040039 | |
| 2. | Hao Wang, Guangmin Sun, Kun Zheng, Hui Li, Jie Liu, Yu Bai, Privacy protection generalization with adversarial fusion, 2022, 19, 1551-0018, 7314, 10.3934/mbe.2022345 | |
| 3. | Yu Li, Hao Liang, Guangmin Sun, Zifeng Yuan, Yuanzhi Zhang, Hongsheng Zhang, A Land Cover Background-Adaptive Framework for Large-Scale Road Extraction, 2022, 14, 2072-4292, 5114, 10.3390/rs14205114 | |
| 4. | Haiying Yuan, Mengfan Dai, Cheng Shi, Minghao Li, Haihang Li, A generative adversarial neural network with multi-attention feature extraction for fundus lesion segmentation, 2023, 43, 1573-2630, 5079, 10.1007/s10792-023-02911-y | |
| 5. | Xue Xia, Kun Zhan, Yuming Fang, Wenhui Jiang, Fei Shen, Lesion‐aware network for diabetic retinopathy diagnosis, 2023, 33, 0899-9457, 1914, 10.1002/ima.22933 | |
| 6. | Tiwalade Modupe Usman, Yakub Kayode Saheed, Adeyemi Abel Ajibesin, Augustine Shey Nsang, 2024, Ens5B-UNet for Improved Microaneurysms Segmentation in Retinal Images, 979-8-3503-5815-5, 1, 10.1109/SEB4SDG60871.2024.10629958 | |
| 7. | Huma Naz, Neelu Jyothi Ahuja, Rahul Nijhawan, Diabetic retinopathy detection using supervised and unsupervised deep learning: a review study, 2024, 57, 1573-7462, 10.1007/s10462-024-10770-x | |
| 8. | Joshua E. Mckone, Tryphon Lambrou, Xujiong Ye, James M. Brown, Weakly supervised pre-training for brain tumor segmentation using principal axis measurements of tumor burden, 2024, 6, 2624-9898, 10.3389/fcomp.2024.1386514 | |
| 9. | Tiwalade Modupe Usman, Adeyemi Abel Ajibesin, Yakub Kayode Saheed, Augustine Shey Nsang, 2023, GAPS-U-NET: Gating Attention And Pixel Shuffling U-Net For Optic Disc Segmentation In Retinal Images, 979-8-3503-5883-4, 1, 10.1109/ICMEAS58693.2023.10429873 |
Figures(3) / Tables(1)
Giovanni Alberti, Giuseppe Buttazzo, Serena Guarino Lo Bianco, Édouard Oudet. Optimal reinforcing networks for elastic membranes[J]. Networks and Heterogeneous Media, 2019, 14(3): 589-615. doi: 10.3934/nhm.2019023
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{36}}}{\bf{|}} $ |
| $ 1 $ | $ 24 $ | $ 48 $ | $ 7 $ |
| $ 2 $ | $ 32 $ | $ 94 $ | $ 14 $ |
| $ 3 $ | $ 40 $ | $ 152 $ | $ 23 $ |
| $ 4 $ | $ 48 $ | $ 222 $ | $ 34 $ |
| $ 5 $ | $ 56 $ | $ 304 $ | $ 47 $ |
| $ 6 $ | $ 64 $ | $ 398 $ | $ 62 $ |
| $ 7 $ | $ 72 $ | $ 504 $ | $ 79 $ |
| $ 8 $ | $ 80 $ | $ 622 $ | $ 98 $ |
| . | . | . | . |
| . | . | . | . |
| . | . | . | . |
| $ {n} $ | $ 8{n}+16 $ | $ 6{n}^{2}+28{n}+14 $ | $ {n}^{2}+4{n}+2 $ |
DownLoad:
CSV
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ |
| $ 1 $ | $ 6 $ | $ 0 $ | $ 0 $ | $ 0 $ |
| $ 2 $ | $ 6 $ | $ 12 $ | $ 12 $ | $ 12 $ |
| $ 3 $ | $ 6 $ | $ 24 $ | $ 24 $ | $ 60 $ |
| $ 4 $ | $ 6 $ | $ 36 $ | $ 36 $ | $ 144 $ |
| $ 5 $ | $ 6 $ | $ 48 $ | $ 48 $ | $ 264 $ |
| $ 6 $ | $ 6 $ | $ 60 $ | $ 60 $ | $ 420 $ |
| $ 7 $ | $ 6 $ | $ 72 $ | $ 72 $ | $ 612 $ |
| $ 8 $ | $ 6 $ | $ 84 $ | $ 84 $ | $ 840 $ |
| . | . | . | . | . |
| . | . | . | . | . |
| . | . | . | . | . |
| $ {k} $ | $ 6 $ | $ 12({k}-1) $ | $ 12({k}-1) $ | $ 18{k}^{2}-42{k}+24 $ |
DownLoad:
CSV
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ {n}-1 $ | $ 20{n}+7 $ |
DownLoad:
CSV
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ 0 $ | $ {n}-1 $ | $ 20{n}+7 $ |
| $ 3 $ | $ 2 $ | $ 2{n} $ | $ 1 $ | $ 3\left({n}-1\right) $ | $ 20{n}+17 $ |
| $ 4 $ | $ 2 $ | $ 2{n} $ | $ 3 $ | $ 5\left({n}-1\right) $ | $ 20{n}+27 $ |
| $ 5 $ | $ 2 $ | $ 2{n} $ | $ 5 $ | $ 7\left({n}-1\right) $ | $ 20{n}+37 $ |
| $ 6 $ | $ 2 $ | $ 2{n} $ | $ 7 $ | $ 9\left({n}-1\right) $ | $ 20{n}+47 $ |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| $ {m} $ | $ 2 $ | $ 2{n} $ | $ 2{m}-5 $ | $ 2{m}{n}-2{m}-3{n}+3 $ | $ 20{n}+10{m}-13 $ |
DownLoad:
CSV
| $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{20}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{35}}}{\bf{|}} $ |
| $ 1 $ | $ 2{n}+1 $ | $ 2 $ | $ 4{n}-2 $ | $ 0 $ | $ 0 $ | $ 2{n}-1 $ | $ 0 $ |
| $ 2 $ | $ 2{n}+2 $ | $ 2 $ | $ 8{n}-2 $ | $ 2 $ | $ 2{n}-2 $ | $ 4{n}-2 $ | $ 2{n}-1 $ |
| $ 3 $ | $ 2{n}+3 $ | $ 2 $ | $ 12{n}-2 $ | $ 4 $ | $ 4{n}-4 $ | $ 6{n}-3 $ | $ 4{n}-2 $ |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| $ {m} $ | $ 2{n}+{m} $ | $ 2 $ | $ 4{m}{n}-2 $ | $ 2{m}-2 $ | $ 2{m}{n}-2\left({m}+{n}\right)+2 $ | $ 2{m}{n}-{m} $ | $ 2{m}{n}-\left({m}+2{n}\right)+1 $ |
DownLoad:
CSV
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{36}}}{\bf{|}} $ |
| $ 1 $ | $ 24 $ | $ 48 $ | $ 7 $ |
| $ 2 $ | $ 32 $ | $ 94 $ | $ 14 $ |
| $ 3 $ | $ 40 $ | $ 152 $ | $ 23 $ |
| $ 4 $ | $ 48 $ | $ 222 $ | $ 34 $ |
| $ 5 $ | $ 56 $ | $ 304 $ | $ 47 $ |
| $ 6 $ | $ 64 $ | $ 398 $ | $ 62 $ |
| $ 7 $ | $ 72 $ | $ 504 $ | $ 79 $ |
| $ 8 $ | $ 80 $ | $ 622 $ | $ 98 $ |
| . | . | . | . |
| . | . | . | . |
| . | . | . | . |
| $ {n} $ | $ 8{n}+16 $ | $ 6{n}^{2}+28{n}+14 $ | $ {n}^{2}+4{n}+2 $ |
| Dimension | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{12}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ |
| $ 1 $ | $ 6 $ | $ 0 $ | $ 0 $ | $ 0 $ |
| $ 2 $ | $ 6 $ | $ 12 $ | $ 12 $ | $ 12 $ |
| $ 3 $ | $ 6 $ | $ 24 $ | $ 24 $ | $ 60 $ |
| $ 4 $ | $ 6 $ | $ 36 $ | $ 36 $ | $ 144 $ |
| $ 5 $ | $ 6 $ | $ 48 $ | $ 48 $ | $ 264 $ |
| $ 6 $ | $ 6 $ | $ 60 $ | $ 60 $ | $ 420 $ |
| $ 7 $ | $ 6 $ | $ 72 $ | $ 72 $ | $ 612 $ |
| $ 8 $ | $ 6 $ | $ 84 $ | $ 84 $ | $ 840 $ |
| . | . | . | . | . |
| . | . | . | . | . |
| . | . | . | . | . |
| $ {k} $ | $ 6 $ | $ 12({k}-1) $ | $ 12({k}-1) $ | $ 18{k}^{2}-42{k}+24 $ |
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ {n}-1 $ | $ 20{n}+7 $ |
| Dimension $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}^{{\bf{\infty}}}{\bf{|}} $ |
| $ 2 $ | $ 3 $ | $ 2\left({n}-1\right) $ | $ 0 $ | $ {n}-1 $ | $ 20{n}+7 $ |
| $ 3 $ | $ 2 $ | $ 2{n} $ | $ 1 $ | $ 3\left({n}-1\right) $ | $ 20{n}+17 $ |
| $ 4 $ | $ 2 $ | $ 2{n} $ | $ 3 $ | $ 5\left({n}-1\right) $ | $ 20{n}+27 $ |
| $ 5 $ | $ 2 $ | $ 2{n} $ | $ 5 $ | $ 7\left({n}-1\right) $ | $ 20{n}+37 $ |
| $ 6 $ | $ 2 $ | $ 2{n} $ | $ 7 $ | $ 9\left({n}-1\right) $ | $ 20{n}+47 $ |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| . | . | . | . | . | . |
| $ {m} $ | $ 2 $ | $ 2{n} $ | $ 2{m}-5 $ | $ 2{m}{n}-2{m}-3{n}+3 $ | $ 20{n}+10{m}-13 $ |
| $ {{\boldsymbol{m}}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{14}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{15}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{16}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{17}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{18}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{20}}}{\bf{|}} $ | $ {\bf{|}}{\boldsymbol{f}}_{{\bf{35}}}{\bf{|}} $ |
| $ 1 $ | $ 2{n}+1 $ | $ 2 $ | $ 4{n}-2 $ | $ 0 $ | $ 0 $ | $ 2{n}-1 $ | $ 0 $ |
| $ 2 $ | $ 2{n}+2 $ | $ 2 $ | $ 8{n}-2 $ | $ 2 $ | $ 2{n}-2 $ | $ 4{n}-2 $ | $ 2{n}-1 $ |
| $ 3 $ | $ 2{n}+3 $ | $ 2 $ | $ 12{n}-2 $ | $ 4 $ | $ 4{n}-4 $ | $ 6{n}-3 $ | $ 4{n}-2 $ |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| . | . | . | . | . | . | . | . |
| $ {m} $ | $ 2{n}+{m} $ | $ 2 $ | $ 4{m}{n}-2 $ | $ 2{m}-2 $ | $ 2{m}{n}-2\left({m}+{n}\right)+2 $ | $ 2{m}{n}-{m} $ | $ 2{m}{n}-\left({m}+2{n}\right)+1 $ |
Approximation of globally optimal reinforcement structures for
Approximation of globaly optimal reinforcement structures for
Approximation of globaly optimal reinforcement strucutres for m = 0.5, L = 1.5, 2.5 and 5 for a source consisting of two dirac masses. The upper colorbar is related to the weights θ which colors the optimal reinforcement set on the left, whereas the lower colorbar stands for the tangential gradient plotted on the connected set on the right picture
