{"title":"Study on Eccentric Coloring of a Graph","authors":"M. Huilgol","doi":"10.9734/bpi/ctmcs/v9/8557d","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/8557d","url":null,"abstract":"The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to e(u). An eccentric coloring of a graph G=(V,E) is a function color: V(to)N such that\u0000(i) for all u,v (epsilon) V,(color(u)=color(v)) (Rightarrow) d(u,v)>color(u).(ii) for all v (epsilon) V,color(v) (le) e(v).\u0000The eccentric chromatic number Xe (epsilon) N for a graph G is the lowest number of colors for which it is possible to eccentrically color G by colors: V (to) {1,2,…,Xe }. In this paper, we have considered eccentric colorability of a graph in relation to other properties. we have considered simple undirected graphs without multiple edges and self loops. Also, we have considered the eccentric colorability of lexicographic product of some special class of graphs.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125960270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Studies on a Property Oriented Pandemic Surviving Trading Model","authors":"D. Oyemade, A. Ojugo","doi":"10.9734/bpi/ctmcs/v9/4238f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/4238f","url":null,"abstract":"The world economy was hit hard by the COVID-19 pandemic. COVID-19, also known as the coronavirus, had a disastrous effect on the prices of commodities such as oil and gas, as well as foreign exchange (Forex) trading systems and currency pairs across nations, causing businesses to collapse and the economy to shut down. It was also accompanied by a significant loss of capital for stock and forex investors as a result of the failure of several stock and forex software systems and strategies that were built without taking into account the high volatility of market values induced by the coronavirus pandemic. This research focuses on examining and analysing the performance of some Forex systems during thepandemic. It analyses failed and successful systems throughout the pandemic period and suggests a pandemic surviving trading model to solve the problem of unforeseen disasters like the pandemic having an impact on trading systems. The system analyses the qualities and data of failed and successful systems, then incorporates the best features into the suggested model to create a model that is likely to survive any future pandemic. \u0000The findings reveal that systems constructed using the property-oriented pandemic surviving trading model generated significantly more profit during the pandemic than current systems.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116064378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Studies on a Type of Para-Kenmotsu Manifold","authors":"T. Satyanarayana, K. Prasad","doi":"10.9734/bpi/ctmcs/v9/3841f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/3841f","url":null,"abstract":"In this chapter, we consider a class of almost para-contact metric manifold namely para-Kenmotsu (briefly P-Kenmotsu) manifold Mn admitting the condition R(X, Y).C = 0 where C is the conformal curvature tensor of the manifold and R is the Riemannian curvature tensor. R(X, Y) is considered as a derivation of the tensor algebra at each point of the manifold for tangent vectors X and Y. We study and have shown that a P-Kenmotsu manifold (Mn, g) (n > 3) admitting the condition R(X, Y).C = 0 is conformally flat and hence is an SP-Kenmotsu manifold, where ‘g’ is the Riemannian metric. For a conformally symmetric Riemannian manifold, we have and hence for such a manifold R(X, Y).C = 0 holds. Thus we have the following corollary. It says that a conformally symmetric P-Kenmotsu manifold (Mn, g) (n > 3) is an SP-Kenmotsu manifold. The chapter ends with a concluding remark that to identify and strengthen the physical significance of the structures and connections discussed in this chapter.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128742252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stability Analysis of Iterative Methods for Solving Nonlinear Algebraic Systems","authors":"Raudys R. Capdevila, A. Cordero, J. Torregrosa","doi":"10.9734/bpi/ctmcs/v9/11959d","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/11959d","url":null,"abstract":"In this chapter, we present a multidimensional real dynamical analysis of a new class of iterative method for approximating the solutions of nonlinear systems of algebraic equations. With the use of the well known discrete dynamic multivariate tools, we study the behavior of the multidimensional rational operator associated with the iterative method, acting on a system of quadratic polynomials of separate and mixed variables, respectively. Some results about the stability of the proposed class are presented. These results allow us to detect and avoid the elements of the family with bad stability properties and chaotical behaviour. Some numerical tests are presented for confirming the theoretical and dynamical results.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131173925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study on Semi-symmetric Para Kenmotsu Manifolds","authors":"T. Satyanarayana, K. Prasad","doi":"10.9734/bpi/ctmcs/v9/4113f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/4113f","url":null,"abstract":"We investigate several interesting characteristics of para Kenmotsu (briefly p-Kenmotsu) manifolds satisfying the conditions R(X,Y) . R = 0, R(X,Y) . P = 0 and P(X,Y) . R = 0, where R(X,Y) is the Riemannian curvature tensor and P(X,Y) is the Weyl projective curvature tensor of the manifold. It is demonstrated that a semi symmetric p-Kenmotsu manifold (Mn,g) has constant curvature and hence an sp-Kenmotsu manifold. Also we obtain the necessary and sufficient condition for a p-Kenmotsu manifold to be Weyl projective semi-symmetric and shown that it is projectively flat. Finally, we prove if the condition P(X,Y) . R = 0 is satisfied on a p-Kenmotsu manifold then its scalar curvature is constant.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123959659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study on Total Dominator Colorings in Paths","authors":"A. Vijayalekshmi","doi":"10.9734/bpi/ctmcs/v9/3822f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/3822f","url":null,"abstract":"In this paper we determine total dominator chromatic number in paths. Let be a graph without isolated vertices. A total dominator coloring of a graph G is a valid colouring of the graph G with the additional feature that each vertex in the graph G dominates a color class properly. The total dominator chromatic number of G is the fewest number of colors for which there is a total dominator coloring of G, and it is indicated by . The total dominator chromatic number in paths is determined in this research. n denotes an integer greater than or equal to 2 unless otherwise specified.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantum-dot Controlled Electronic Block Triggering a Quantum Computation Procedure: A Recent Study","authors":"V. Voronov","doi":"10.9734/bpi/ctmcs/v9/4204f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/4204f","url":null,"abstract":"The works that have been devoted to the topic of quantum computer design have been examined. The main issues surrounding the development of a quantum computer are explored. The “up to bottom” concept has been presented and supported as a fundamentally novel way to solve the problem of building a really quantum computer. The technique can be accomplished by using nanotriggers made of two-dimensional materials, such as graphene, to visualise the quantum states of qubits in advance. This refers to the visualisation (materialisation) of all states, including entangled states, which primarily determine the quantum computer's theoretically large mathematical resource. The proposal is for an electronic device block diagram based on “a priory” quantum states of q-bits. It is demonstrated that each realised (visualised) Shor's cell should correspond to an element of the electronic system for the execution of quantum computation procedures. A block containing at least 1010 nanotriggers that act as q-bits in quantum computation and are generated using graphene nanoribbons and controlled by a specific element is included in the device. The latter is a self-organizing quantum dot with two essentially different magnetic states. This quantum dot is made from a compound whose molecules are distinguished by intramolular rearrangement. Nanotriggers are used to create reversible logic gates or blocks. Three triggers are included in each gate to perform logical operations. The offered device is an additional electronic unit implanted in a digital computer that allows the computational process to be implemented in accordance with the requirements of quantum physics.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132451468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Approach to Integrating Courses' Relationship into Predicting Student Performance","authors":"Thanh-Nhan Huynh-Ly, Huy T. Le, Thai-Nghe Nguyen","doi":"10.9734/bpi/ctmcs/v9/4193f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/4193f","url":null,"abstract":"Predicting student learning performance to suggest courses is a vital role of an academic adviser in the Intelligent Tutoring System (ITS) as well as the university's E-learning system.Many different approaches, such as classification, regression, association rules, and recommender systems, have been used to solve this problem. Recently, using collaborative filtering in the recommender system, particularly the matrix factorization technique, to develop the courses' recommendation system was a measurable success. \u0000Many breakthroughs have been made to increase prediction accuracy, such as leveraging student profiles, course features, or course relationships, but they have not yet been mined. This paper suggests a method for improving prediction accuracy by including course relationships into the course recommendation system. When we validate the published educational datasets, the experimental outcomes of the proposed approach are positive.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117171590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized Ostrowski Type Inequality with Applications in Numerical Integration, Probability Theory and Special Means","authors":"Nazia Irshad, Asif R Khan, Muhammad Awais Shaikh","doi":"10.9734/bpi/ctmcs/v9/11827d","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/11827d","url":null,"abstract":"Generalization of Ostrowski type inequality with applications in numerical integration, probability theory and special means is stated for differentiable functions up to second order whose second order derivatives are bounded and first order derivatives are absolutely continuous.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131826638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study on the Work-fields of the Entire Methods","authors":"T. Balasubramanian, A. Pandiarani","doi":"10.9734/bpi/ctmcs/v9/3472f","DOIUrl":"https://doi.org/10.9734/bpi/ctmcs/v9/3472f","url":null,"abstract":"The goal of this chapter is to investigate the work fields of the entire methods.The distinguished subsets of (Gamma)A are defined , and the relationship between them is established..The following are some examples of usual outcomes in this chapter:\u0000Let P={x (epsilon) (Gamma)A : t(Ax)=(tA)x for all t (epsilon) (Lambda) such that (tA)y exists for all y (epsilon) (Gamma)A}The set P is closed and P = (bar{Gamma}) where closure is taken in the semi-norm topology of (Gamma)A","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125232290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}