If G is a connected graph, the distance d (u,v) between two vertices u,v ∈ V(G) is the length of a shortest path between them. Let W = {w1, w2, ..., wk} be an ordered set of vertices of G and let v be a vertex of G ....If G is a connected graph, the distance d (u,v) between two vertices u,v ∈ V(G) is the length of a shortest path between them. Let W = {w1, w2, ..., wk} be an ordered set of vertices of G and let v be a vertex of G . The repre-sentation r(v|W) of v with respect to W is the k-tuple (d(v,w1), d(v,w2), …, d(v,wk)). . If distinct vertices of G have distinct representations with respect to W , then W is called a resolving set or locating set for G. A re-solving set of minimum cardinality is called a basis for G and this cardinality is the metric dimension of G , denoted by dim (G). A family ? of connected graphs is a family with constant metric dimension if dim (G) is finite and does not depend upon the choice of G in ?. In this paper, we show that dragon graph denoted by Tn,m and the graph obtained from prism denoted by 2Ck + {xkyk} have constant metric dimension.展开更多
This article introduces a fastmeshless algorithm for the numerical solution nonlinear partial differential equations(PDE)by Radial Basis Functions(RBFs)approximation connected with the Total Variation(TV)-basedminimiz...This article introduces a fastmeshless algorithm for the numerical solution nonlinear partial differential equations(PDE)by Radial Basis Functions(RBFs)approximation connected with the Total Variation(TV)-basedminimization functional and to show its application to image denoising containing multiplicative noise.These capabilities used within the proposed algorithm have not only the quality of image denoising,edge preservation but also the property of minimization of staircase effect which results in blocky effects in the images.It is worth mentioning that the recommended method can be easily employed for nonlinear problems due to the lack of dependence on a mesh or integration procedure.The numerical investigations and corresponding examples prove the effectiveness of the recommended algorithm regarding the robustness and visual improvement as well as peak-signal-to-noise ratio(PSNR),signal-to-noise ratio(SNR),and structural similarity index(SSIM)corresponded to the current conventional TV-based schemes.展开更多
In this paper,we classify static spherically symmetric(SS)perfect fluid space-times via conformal vector fields(CVFs)in f(T)gravity.For this analysis,we first explore static SS solutions by solving the Einstein field ...In this paper,we classify static spherically symmetric(SS)perfect fluid space-times via conformal vector fields(CVFs)in f(T)gravity.For this analysis,we first explore static SS solutions by solving the Einstein field equations in f(T)gravity.Secondly,we implement a direct integration technique to classify the resulting solutions.During the classification,there arose 20 cases.Studying each case thoroughly,we came to know that in three cases the space-times under consideration admit proper CVFs in f(T)gravity.In one case,the space-time admits proper homothetic vector fields,whereas in the remaining 16 cases either the space-times become conformally flat or they admit Killing vector fields.展开更多
文摘If G is a connected graph, the distance d (u,v) between two vertices u,v ∈ V(G) is the length of a shortest path between them. Let W = {w1, w2, ..., wk} be an ordered set of vertices of G and let v be a vertex of G . The repre-sentation r(v|W) of v with respect to W is the k-tuple (d(v,w1), d(v,w2), …, d(v,wk)). . If distinct vertices of G have distinct representations with respect to W , then W is called a resolving set or locating set for G. A re-solving set of minimum cardinality is called a basis for G and this cardinality is the metric dimension of G , denoted by dim (G). A family ? of connected graphs is a family with constant metric dimension if dim (G) is finite and does not depend upon the choice of G in ?. In this paper, we show that dragon graph denoted by Tn,m and the graph obtained from prism denoted by 2Ck + {xkyk} have constant metric dimension.
文摘This article introduces a fastmeshless algorithm for the numerical solution nonlinear partial differential equations(PDE)by Radial Basis Functions(RBFs)approximation connected with the Total Variation(TV)-basedminimization functional and to show its application to image denoising containing multiplicative noise.These capabilities used within the proposed algorithm have not only the quality of image denoising,edge preservation but also the property of minimization of staircase effect which results in blocky effects in the images.It is worth mentioning that the recommended method can be easily employed for nonlinear problems due to the lack of dependence on a mesh or integration procedure.The numerical investigations and corresponding examples prove the effectiveness of the recommended algorithm regarding the robustness and visual improvement as well as peak-signal-to-noise ratio(PSNR),signal-to-noise ratio(SNR),and structural similarity index(SSIM)corresponded to the current conventional TV-based schemes.
文摘In this paper,we classify static spherically symmetric(SS)perfect fluid space-times via conformal vector fields(CVFs)in f(T)gravity.For this analysis,we first explore static SS solutions by solving the Einstein field equations in f(T)gravity.Secondly,we implement a direct integration technique to classify the resulting solutions.During the classification,there arose 20 cases.Studying each case thoroughly,we came to know that in three cases the space-times under consideration admit proper CVFs in f(T)gravity.In one case,the space-time admits proper homothetic vector fields,whereas in the remaining 16 cases either the space-times become conformally flat or they admit Killing vector fields.
